Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r224-tall-174902010100334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r224-tall-174902010100334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 2.0M May 29 14:33 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 1749107976187

Invoking MCC driver with
BK_TOOL=gold2024
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 greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:19:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-05 07:19:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:19:37] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2025-06-05 07:19:37] [INFO ] Transformed 194 places.
[2025-06-05 07:19:37] [INFO ] Transformed 2205 transitions.
[2025-06-05 07:19:37] [INFO ] Found NUPN structural information;
[2025-06-05 07:19:37] [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]
[2025-06-05 07:19:37] [INFO ] Parsed PT model containing 194 places and 2205 transitions and 15678 arcs in 318 ms.
Built sparse matrix representations for Structural reductions in 13 ms.20561KB 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 187 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 201 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 100 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2025-06-05 07:19:38] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2025-06-05 07:19:38] [INFO ] Invariants computation overflowed in 29 ms
[2025-06-05 07:19:38] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-05 07:19:38] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2025-06-05 07:19:38] [INFO ] Invariants computation overflowed in 13 ms
[2025-06-05 07:19:39] [INFO ] State equation strengthened by 820 read => feed constraints.
[2025-06-05 07:19:39] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2025-06-05 07:19:39] [INFO ] Redundant transitions in 101 ms returned []
Running 2185 sub problems to find dead transitions.
[2025-06-05 07:19:39] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2025-06-05 07:19:39] [INFO ] Invariants computation overflowed in 16 ms
[2025-06-05 07:19:39] [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
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
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1383 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1396 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1746 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2093 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
At refinement iteration 2 (OVERLAPS) 1745/1919 variables, 174/348 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1919 variables, 820/1168 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1919/1939 variables, and 1168 constraints, problems are : Problem set: 887 solved, 1298 unsolved in 30053 ms.
Refiners :[Domain max(s): 174/194 constraints, State Equation: 174/194 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 2185/2125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 887 solved, 1298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/174 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
At refinement iteration 2 (OVERLAPS) 1745/1919 variables, 174/348 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1919 variables, 820/1168 constraints. Problems are: Problem set: 887 solved, 1298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1919/1939 variables, and 2386 constraints, problems are : Problem set: 887 solved, 1298 unsolved in 33047 ms.
Refiners :[Domain max(s): 174/194 constraints, State Equation: 174/194 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 1278/2125 constraints, Known Traps: 0/0 constraints]
After SMT, in 82572ms problems are : Problem set: 887 solved, 1298 unsolved
Search for dead transitions found 887 dead transitions in 82612ms
Found 887 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 887 transitions
Dead transitions reduction (with SMT) removed 887 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 194/194 places, 1318/2205 transitions.
Computed a total of 18 stabilizing places and 76 stable transitions
Reduce places removed 0 places and 4 transitions.
Computed a total of 18 stabilizing places and 72 stable transitions
Graph (complete) has 3091 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 1314
Reduce places removed 0 places and 4 transitions.
Computed a total of 16 stabilizing places and 68 stable transitions
Graph (complete) has 3079 edges and 192 vertex of which 190 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 190 transition count 1310
Reduce places removed 0 places and 4 transitions.
Computed a total of 14 stabilizing places and 64 stable transitions
Graph (complete) has 3067 edges and 190 vertex of which 188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 188 transition count 1306
Reduce places removed 0 places and 4 transitions.
Computed a total of 12 stabilizing places and 60 stable transitions
Graph (complete) has 3055 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 186 transition count 1302
Reduce places removed 0 places and 4 transitions.
Computed a total of 10 stabilizing places and 56 stable transitions
Graph (complete) has 3043 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 184 transition count 1298
Reduce places removed 0 places and 4 transitions.
Computed a total of 8 stabilizing places and 52 stable transitions
Graph (complete) has 3031 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 182 transition count 1294
Reduce places removed 0 places and 4 transitions.
Computed a total of 6 stabilizing places and 48 stable transitions
Graph (complete) has 3019 edges and 182 vertex of which 180 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 180 transition count 1290
Reduce places removed 0 places and 4 transitions.
Computed a total of 4 stabilizing places and 44 stable transitions
Graph (complete) has 3007 edges and 180 vertex of which 178 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 178 transition count 1286
Reduce places removed 0 places and 44 transitions.
Computed a total of 2 stabilizing places and 0 stable transitions
Graph (complete) has 2873 edges and 178 vertex of which 176 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 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 9 rules in 143 ms. Remains 176 /194 variables (removed 18) and now considering 1242/1318 (removed 76) transitions.
[2025-06-05 07:21:02] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
// Phase 1: matrix 989 rows 176 cols
[2025-06-05 07:21:02] [INFO ] Computed 49 invariants in 21 ms
[2025-06-05 07:21:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-05 07:21:02] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2025-06-05 07:21:02] [INFO ] Invariant cache hit.
[2025-06-05 07:21:02] [INFO ] State equation strengthened by 442 read => feed constraints.
[2025-06-05 07:21:02] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 390 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 84272 ms. Remains : 176/194 places, 1242/2205 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6489 ms (no deadlock found). (steps per millisecond=192 )
Random directed walk for 1250000 steps, including 0 resets, run took 6181 ms (no deadlock found). (steps per millisecond=202 )
[2025-06-05 07:21:15] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2025-06-05 07:21:15] [INFO ] Invariant cache hit.
[2025-06-05 07:21:15] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2025-06-05 07:21:15] [INFO ] [Real]Absence check using 46 positive and 3 generalized place invariants in 25 ms returned sat
[2025-06-05 07:21:16] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2025-06-05 07:21:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:21:16] [INFO ] [Nat]Absence check using 46 positive place invariants in 30 ms returned sat
[2025-06-05 07:21:16] [INFO ] [Nat]Absence check using 46 positive and 3 generalized place invariants in 13 ms returned sat
[2025-06-05 07:21:16] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2025-06-05 07:21:16] [INFO ] State equation strengthened by 442 read => feed constraints.
[2025-06-05 07:21:23] [INFO ] [Nat]Added 442 Read/Feed constraints in 6741 ms returned sat
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 15 places in 195 ms of which 7 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 2 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 1 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 1 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 1 ms to minimize.
[2025-06-05 07:21:24] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 0 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 0 ms to minimize.
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 4 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 1 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 1 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 2 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4223 ms
[2025-06-05 07:21:27] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4226 ms
[2025-06-05 07:21:27] [INFO ] Computed and/alt/rep : 40/80/40 causal constraints (skipped 929 transitions) in 172 ms.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 0 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 0 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 0 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 0 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 0 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 0 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 1 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 23 places in 171 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 1 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 1 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 0 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 7 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 9471 ms
[2025-06-05 07:21:37] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500001 steps, including 0 resets, run took 2468 ms (no deadlock found). (steps per millisecond=202 )
Random walk for 500000 steps, including 0 resets, run took 2567 ms (no deadlock found). (steps per millisecond=194 )
Random directed walk for 500000 steps, including 0 resets, run took 2421 ms (no deadlock found). (steps per millisecond=206 )
Random walk for 500000 steps, including 0 resets, run took 2501 ms (no deadlock found). (steps per millisecond=199 )
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 38 ms. Remains 176 /176 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2025-06-05 07:21:47] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2025-06-05 07:21:47] [INFO ] Invariant cache hit.
[2025-06-05 07:21:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 07:21:47] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2025-06-05 07:21:47] [INFO ] Invariant cache hit.
[2025-06-05 07:21:47] [INFO ] State equation strengthened by 442 read => feed constraints.
[2025-06-05 07:21:47] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2025-06-05 07:21:47] [INFO ] Redundant transitions in 49 ms returned []
Running 1222 sub problems to find dead transitions.
[2025-06-05 07:21:47] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2025-06-05 07:21:47] [INFO ] Invariant cache hit.
[2025-06-05 07:21:47] [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
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2025-06-05 07:22:20] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:22:20] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 1 ms to minimize.
[2025-06-05 07:22:20] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:22:20] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:22:20] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 1 ms to minimize.
[2025-06-05 07:22:23] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 20/245 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 245 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30021 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: 20/20 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, 11/174 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (OVERLAPS) 20/176 variables, 41/215 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 9/245 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2025-06-05 07:22:47] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2025-06-05 07:22:55] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 1 ms to minimize.
[2025-06-05 07:22:55] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 1 ms to minimize.
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 176/1165 variables, and 248 constraints, problems are : Problem set: 1 solved, 1221 unsolved in 30020 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: 0/1222 constraints, Known Traps: 23/23 constraints]
After SMT, in 67938ms problems are : Problem set: 1 solved, 1221 unsolved
Search for dead transitions found 1 dead transitions in 67951ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 176/176 places, 1241/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 38 ms. Remains 176 /176 variables (removed 0) and now considering 1241/1241 (removed 0) transitions.
[2025-06-05 07:22:55] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 68435 ms. Remains : 176/176 places, 1241/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6171 ms (no deadlock found). (steps per millisecond=202 )
Random directed walk for 1250002 steps, including 0 resets, run took 5862 ms (no deadlock found). (steps per millisecond=213 )
[2025-06-05 07:23:08] [INFO ] Flow matrix only has 989 transitions (discarded 252 similar events)
[2025-06-05 07:23:08] [INFO ] Invariant cache hit.
[2025-06-05 07:23:08] [INFO ] [Real]Absence check using 46 positive place invariants in 30 ms returned sat
[2025-06-05 07:23:08] [INFO ] [Real]Absence check using 46 positive and 3 generalized place invariants in 10 ms returned sat
[2025-06-05 07:23:08] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2025-06-05 07:23:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:23:08] [INFO ] [Nat]Absence check using 46 positive place invariants in 29 ms returned sat
[2025-06-05 07:23:08] [INFO ] [Nat]Absence check using 46 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-05 07:23:09] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2025-06-05 07:23:09] [INFO ] State equation strengthened by 442 read => feed constraints.
[2025-06-05 07:23:16] [INFO ] [Nat]Added 442 Read/Feed constraints in 6814 ms returned sat
[2025-06-05 07:23:16] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2025-06-05 07:23:16] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2025-06-05 07:23:16] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2025-06-05 07:23:17] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2025-06-05 07:23:17] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 1 ms to minimize.
[2025-06-05 07:23:17] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2025-06-05 07:23:17] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 1 ms to minimize.
[2025-06-05 07:23:17] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2025-06-05 07:23:18] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 0 ms to minimize.
[2025-06-05 07:23:19] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 1 ms to minimize.
[2025-06-05 07:23:19] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2025-06-05 07:23:19] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2025-06-05 07:23:19] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 0 ms to minimize.
[2025-06-05 07:23:19] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 1 ms to minimize.
[2025-06-05 07:23:20] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2025-06-05 07:23:20] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 5 ms to minimize.
[2025-06-05 07:23:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 4000 ms
[2025-06-05 07:23:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4000 ms
[2025-06-05 07:23:20] [INFO ] Computed and/alt/rep : 40/80/40 causal constraints (skipped 929 transitions) in 102 ms.
[2025-06-05 07:23:20] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2025-06-05 07:23:20] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 1 ms to minimize.
[2025-06-05 07:23:20] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 0 ms to minimize.
[2025-06-05 07:23:21] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2025-06-05 07:23:21] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2025-06-05 07:23:21] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 1 ms to minimize.
[2025-06-05 07:23:21] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 1 ms to minimize.
[2025-06-05 07:23:21] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 1 ms to minimize.
[2025-06-05 07:23:22] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2025-06-05 07:23:22] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 1 ms to minimize.
[2025-06-05 07:23:22] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2025-06-05 07:23:22] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 0 ms to minimize.
[2025-06-05 07:23:22] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 1 ms to minimize.
[2025-06-05 07:23:23] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2025-06-05 07:23:23] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 1 ms to minimize.
[2025-06-05 07:23:23] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2025-06-05 07:23:23] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 0 ms to minimize.
[2025-06-05 07:23:23] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 1 ms to minimize.
[2025-06-05 07:23:24] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2025-06-05 07:23:24] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 0 ms to minimize.
[2025-06-05 07:23:24] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:23:24] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 0 ms to minimize.
[2025-06-05 07:23:24] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 1 ms to minimize.
[2025-06-05 07:23:25] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:23:25] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:23:25] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 0 ms to minimize.
[2025-06-05 07:23:25] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:23:25] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:23:26] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:23:26] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
[2025-06-05 07:23:26] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:23:26] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 1 ms to minimize.
[2025-06-05 07:23:26] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2025-06-05 07:23:27] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 1 ms to minimize.
[2025-06-05 07:23:27] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 1 ms to minimize.
[2025-06-05 07:23:27] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2025-06-05 07:23:28] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2025-06-05 07:23:28] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2025-06-05 07:23:28] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 1 ms to minimize.
[2025-06-05 07:23:28] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2025-06-05 07:23:28] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2025-06-05 07:23:29] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2025-06-05 07:23:29] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2025-06-05 07:23:29] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2025-06-05 07:23:29] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 1 ms to minimize.
[2025-06-05 07:23:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 9414 ms
[2025-06-05 07:23:29] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500000 steps, including 0 resets, run took 2475 ms (no deadlock found). (steps per millisecond=202 )
Random walk for 500000 steps, including 0 resets, run took 2442 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 500000 steps, including 0 resets, run took 2392 ms (no deadlock found). (steps per millisecond=209 )
Random walk for 500000 steps, including 0 resets, run took 2440 ms (no deadlock found). (steps per millisecond=204 )
[2025-06-05 07:23:40] [INFO ] Flatten gal took : 298 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 2 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 2 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 2 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 65 ms. Remains 132 /194 variables (removed 62) and now considering 2163/2205 (removed 42) transitions.
[2025-06-05 07:23:40] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2025-06-05 07:23:40] [INFO ] Invariants computation overflowed in 14 ms
[2025-06-05 07:23:40] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-05 07:23:40] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2025-06-05 07:23:40] [INFO ] Invariants computation overflowed in 9 ms
[2025-06-05 07:23:41] [INFO ] State equation strengthened by 820 read => feed constraints.
[2025-06-05 07:23:44] [INFO ] Implicit Places using invariants and state equation in 4094 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4402 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 1 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 41 ms. Remains 128 /130 variables (removed 2) and now considering 2161/2163 (removed 2) transitions.
[2025-06-05 07:23:44] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:23:44] [INFO ] Invariants computation overflowed in 5 ms
[2025-06-05 07:23:44] [INFO ] Implicit Places using invariants in 260 ms returned []
[2025-06-05 07:23:44] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:23:44] [INFO ] Invariants computation overflowed in 7 ms
[2025-06-05 07:23:45] [INFO ] State equation strengthened by 820 read => feed constraints.
[2025-06-05 07:23:47] [INFO ] Implicit Places using invariants and state equation in 2911 ms returned []
Implicit Place search using SMT with State Equation took 3174 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 7683 ms. Remains : 128/194 places, 2161/2205 transitions.
Initial state reduction rules removed 20 formulas.
RANDOM walk for 40000 steps (8 resets) in 7174 ms. (5 steps per ms) remains 1115/2141 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1114/1115 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1114/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1114 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1113/1113 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1113/1113 properties
[2025-06-05 07:23:50] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:23:50] [INFO ] Invariants computation overflowed in 6 ms
[2025-06-05 07:23:50] [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, 1113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1113 unsolved
SMT process timed out in 16087ms, After SMT, problems are : Problem set: 0 solved, 1113 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 107 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 108 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 2040654 steps (4 resets) in 120004 ms. (17 steps per ms) remains 964/1113 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 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 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 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 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 4004 steps (8 resets) in 30 ms. (129 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 44 ms. (88 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 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 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 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 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 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 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 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 44 ms. (88 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 38 ms. (102 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 46 ms. (85 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 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 4004 steps (8 resets) in 51 ms. (77 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 4003 steps (8 resets) in 33 ms. (117 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 44 ms. (88 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 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
[2025-06-05 07:24:36] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:24:36] [INFO ] Invariants computation overflowed in 8 ms
[2025-06-05 07:24:37] [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 45023 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 45025 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 99002ms 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 78 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 78 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 2139525 steps (4 resets) in 120004 ms. (17 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 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 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 964/964 properties
Probabilistic random walk after 1000001 steps, saw 604471 distinct states, run finished after 49286 ms. (steps per millisecond=20 ) properties seen :0
[2025-06-05 07:27:35] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:27:35] [INFO ] Invariants computation overflowed in 12 ms
[2025-06-05 07:27:35] [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
At refinement iteration 4 (INCLUDED_ONLY) 0/1787 variables, 0/992 constraints. Problems are: Problem set: 0 solved, 964 unsolved
(t196 (/ 49.0timeout
^^^^^^^^^^^
(error "Invalid token: 49.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 (/ 392.0 25.0))
(t1 (/ 49.0 10.0))
(t2 (/ 202.0 25.0))
(t3 (/ 129.0 25.0))
(t4 (/ 26.0 5.0))
(t5 (/ 174.0 25.0))
(t6 (/ 303.0 50.0))
(t7 2.0)
(t8 (/ 221.0 25.0))
(t9 (/ 539.0 50.0))
(t10 (/ 123.0 25.0))
(t11 (/ 123.0 50.0))
(t12 (/ 59.0 10.0))
(t13 2.0)
(t14 (/ 147.0 10.0))
(t15 (/ 226.0 25.0))
(t16 (/ 491.0 50.0))
(t17 (/ 294.0 25.0))
(t18 (/ 347.0 50.0))
(t19 (/ 69.0 10.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 (/ 49.0 50.0))
(t30 (/ 49.0 50.0))
(t31 (/ 49.0 50.0))
(t32 (/ 49.0 50.0))
(t33 (/ 49.0 50.0))
(t34 (/ 49.0 50.0))
(t35 (/ 49.0 50.0))
(t36 (/ 49.0 50.0))
(t37 0.0)
(t38 (/ 49.0 50.0))
(t39 (/ 49.0 50.0))
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 (/ 49.0 50.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 0.0)
(t67 0.0)
(t68 0.0)
(t69 (/ 49.0 50.0))
(t70 (/ 49.0 50.0))
(t71 (/ 49.0 50.0))
(t72 (/ 49.0 50.0))
(t73 (/ 49.0 50.0))
(t74 (/ 3.0 25.0))
(t75 (/ 49.0 50.0))
(t76 (/ 49.0 50.0))
(t77 0.0)
(t78 (/ 1.0 10.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 0.0)
(t89 (/ 49.0 50.0))
(t90 (/ 49.0 50.0))
(t91 (/ 9.0 50.0))
(t92 0.0)
(t93 0.0)
(t94 (/ 49.0 50.0))
(t95 0.0)
(t96 0.0)
(t97 (/ 3.0 50.0))
(t98 0.0)
(t99 (/ 49.0 50.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 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 (/ 49.0 50.0))
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 (/ 49.0 50.0))
(t130 0.0)
(t131 (/ 49.0 50.0))
(t132 (/ 49.0 50.0))
(t133 (/ 49.0 50.0))
(t134 0.0)
(t135 (/ 49.0 50.0))
(t136 (/ 2.0 25.0))
(t137 0.0)
(t138 (/ 49.0 50.0))
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 (/ 49.0 50.0))
(t150 (/ 49.0 50.0))
(t151 (/ 49.0 50.0))
(t152 (/ 4.0 25.0))
(t153 0.0)
(t154 (/ 49.0 50.0))
(t155 0.0)
(t156 0.0)
(t157 (/ 49.0 50.0))
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.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 (/ 1.0 50.0))
(t174 0.0)
(t175 (/ 49.0 50.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 0.0)
(t189 (/ 49.0 50.0))
(t190 (/ 49.0 50.0))
(t191 0.0)
(t192 (/ 49.0 50.0))
(t193 (/ 49.0 50.0))
(t194 0.0)
(t195 (/ 49.0 50.0))
(t196 (/ 49.0timeout
50.0))
(t197 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 84099ms, After SMT, problems are : Problem set: 0 solved, 964 unsolved
Fused 964 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 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 114 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 115 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 101 ms. Remains 128 /128 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
[2025-06-05 07:29:00] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:29:00] [INFO ] Invariants computation overflowed in 17 ms
[2025-06-05 07:29:00] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-05 07:29:00] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:29:00] [INFO ] Invariants computation overflowed in 11 ms
[2025-06-05 07:29:00] [INFO ] State equation strengthened by 820 read => feed constraints.
[2025-06-05 07:29:01] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2025-06-05 07:29:01] [INFO ] Redundant transitions in 33 ms returned []
Running 2141 sub problems to find dead transitions.
[2025-06-05 07:29:01] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:29:01] [INFO ] Invariants computation overflowed in 13 ms
[2025-06-05 07:29:01] [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 30043 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 30186 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 80900ms problems are : Problem set: 0 solved, 2141 unsolved
Search for dead transitions found 0 dead transitions in 80920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82373 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 400000 steps (8 resets) in 8401 ms. (47 steps per ms) remains 18/86 properties
Running SMT prover for 18 properties.
[2025-06-05 07:30:25] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2025-06-05 07:30:25] [INFO ] Invariants computation overflowed in 9 ms
[2025-06-05 07:30:25] [INFO ] After 710ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16
[2025-06-05 07:30:25] [INFO ] State equation strengthened by 820 read => feed constraints.
[2025-06-05 07:30:26] [INFO ] After 747ms SMT Verify possible using 820 Read/Feed constraints in real domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-05 07:30:28] [INFO ] After 2098ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-05 07:30:28] [INFO ] After 2891ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2025-06-05 07:30:29] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2025-06-05 07:30:30] [INFO ] After 1746ms SMT Verify possible using 820 Read/Feed constraints in natural domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2025-06-05 07:30:34] [INFO ] After 5188ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
[2025-06-05 07:30:37] [INFO ] After 9014ms 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 659582 ms.
ITS solved all properties within timeout

BK_STOP 1749108637202

--------------------
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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r224-tall-174902010100334"
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.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;