Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r386-smll-171683818400012.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d0m18, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r386-smll-171683818400012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716891530922

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SieveSingleMsgMbox-PT-d0m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:18:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 10:18:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:18:53] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-28 10:18:53] [INFO ] Transformed 262 places.
[2024-05-28 10:18:53] [INFO ] Transformed 73 transitions.
[2024-05-28 10:18:53] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 376 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 262/262 places, 73/73 transitions.
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 70 transition count 73
Applied a total of 192 rules in 39 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-05-28 10:18:54] [INFO ] Computed 5 invariants in 19 ms
[2024-05-28 10:18:54] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-28 10:18:54] [INFO ] Invariant cache hit.
[2024-05-28 10:18:54] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-28 10:18:54] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-28 10:18:54] [INFO ] Invariant cache hit.
[2024-05-28 10:18:54] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 10:18:56] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 26 ms to minimize.
[2024-05-28 10:18:56] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 10:18:58] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4568 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/143 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 31/109 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 72/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 181 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
After SMT, in 9632ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9660ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 10662 ms. Remains : 70/262 places, 73/73 transitions.
Discarding 10 transitions out of 73. Remains 63
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8925 resets) in 3014 ms. (13 steps per ms) remains 38/62 properties
BEST_FIRST walk for 4001 steps (186 resets) in 114 ms. (34 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (188 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (188 resets) in 66 ms. (59 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (198 resets) in 63 ms. (62 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (202 resets) in 65 ms. (60 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (195 resets) in 61 ms. (64 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (198 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (205 resets) in 102 ms. (38 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (172 resets) in 51 ms. (76 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (186 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (197 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (160 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (197 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (206 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (188 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (203 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (179 resets) in 18 ms. (210 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4003 steps (208 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (186 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (201 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (195 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (800 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (435 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (431 resets) in 60 ms. (65 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (397 resets) in 108 ms. (36 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (421 resets) in 86 ms. (46 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (424 resets) in 86 ms. (46 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (396 resets) in 76 ms. (51 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (413 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (421 resets) in 91 ms. (43 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (397 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (435 resets) in 27 ms. (143 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (439 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (406 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (427 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (384 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
[2024-05-28 10:19:06] [INFO ] Invariant cache hit.
[2024-05-28 10:19:06] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 2/143 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 0 solved, 35 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 24/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 15/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 141 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 3550ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 31 different solutions.
Parikh walk visited 7 properties in 1922 ms.
Support contains 35 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 67 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 67 transition count 70
Applied a total of 6 rules in 19 ms. Remains 67 /70 variables (removed 3) and now considering 70/73 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 4000000 steps (894410 resets) in 20265 ms. (197 steps per ms) remains 25/28 properties
BEST_FIRST walk for 400003 steps (19311 resets) in 706 ms. (565 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19319 resets) in 705 ms. (566 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19210 resets) in 689 ms. (579 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19290 resets) in 698 ms. (572 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19149 resets) in 789 ms. (506 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19259 resets) in 688 ms. (580 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19387 resets) in 937 ms. (426 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19364 resets) in 694 ms. (575 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (19302 resets) in 715 ms. (558 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (18915 resets) in 712 ms. (561 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (19398 resets) in 703 ms. (568 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19208 resets) in 707 ms. (564 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (19378 resets) in 702 ms. (568 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (19355 resets) in 702 ms. (568 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1317 ms. (303 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (41598 resets) in 1082 ms. (369 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (41076 resets) in 947 ms. (421 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41856 resets) in 892 ms. (447 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41172 resets) in 877 ms. (455 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41123 resets) in 1019 ms. (392 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (41240 resets) in 868 ms. (460 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (41041 resets) in 864 ms. (462 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (41453 resets) in 870 ms. (459 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (40825 resets) in 863 ms. (462 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (41294 resets) in 860 ms. (464 steps per ms) remains 25/25 properties
// Phase 1: matrix 70 rows 67 cols
[2024-05-28 10:19:24] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 10:19:24] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 29/99 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 3/137 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 102 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 29/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 4/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 29/99 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 10/109 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 3/137 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 15/127 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 127 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 2024 ms.
Support contains 32 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 66
Applied a total of 7 rules in 23 ms. Remains 64 /67 variables (removed 3) and now considering 66/70 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 64/67 places, 66/70 transitions.
RANDOM walk for 4000000 steps (894721 resets) in 18507 ms. (216 steps per ms) remains 23/25 properties
BEST_FIRST walk for 400003 steps (19251 resets) in 1129 ms. (353 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (19231 resets) in 745 ms. (536 steps per ms) remains 20/23 properties
BEST_FIRST walk for 400002 steps (19197 resets) in 692 ms. (577 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19362 resets) in 688 ms. (580 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19295 resets) in 685 ms. (583 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19191 resets) in 690 ms. (578 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19334 resets) in 942 ms. (424 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19252 resets) in 759 ms. (526 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19355 resets) in 728 ms. (548 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19299 resets) in 706 ms. (565 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19295 resets) in 707 ms. (564 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19240 resets) in 711 ms. (561 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1110 ms. (360 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41970 resets) in 895 ms. (446 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41412 resets) in 902 ms. (442 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (41261 resets) in 897 ms. (445 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41624 resets) in 889 ms. (449 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (41347 resets) in 898 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41527 resets) in 894 ms. (446 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (40556 resets) in 879 ms. (454 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41469 resets) in 886 ms. (450 steps per ms) remains 20/20 properties
// Phase 1: matrix 66 rows 64 cols
[2024-05-28 10:19:40] [INFO ] Computed 5 invariants in 6 ms
[2024-05-28 10:19:40] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 31/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/62 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 65/127 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 3/130 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 97 constraints, problems are : Problem set: 0 solved, 20 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 31/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/62 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 65/127 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 3/130 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 117 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1920ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1403 ms.
Support contains 26 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 64
Applied a total of 4 rules in 13 ms. Remains 62 /64 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 62/64 places, 64/66 transitions.
RANDOM walk for 4000000 steps (894063 resets) in 22506 ms. (177 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19173 resets) in 743 ms. (537 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19261 resets) in 868 ms. (460 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19324 resets) in 729 ms. (547 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (19274 resets) in 720 ms. (554 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19264 resets) in 731 ms. (546 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19090 resets) in 717 ms. (557 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19147 resets) in 716 ms. (557 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19228 resets) in 700 ms. (570 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19175 resets) in 680 ms. (587 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19411 resets) in 701 ms. (569 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19292 resets) in 694 ms. (575 steps per ms) remains 18/20 properties
BEST_FIRST walk for 400002 steps (41855 resets) in 830 ms. (481 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41338 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41153 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41027 resets) in 810 ms. (493 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (41341 resets) in 805 ms. (496 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41429 resets) in 804 ms. (496 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (40785 resets) in 953 ms. (419 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41180 resets) in 1027 ms. (389 steps per ms) remains 18/18 properties
// Phase 1: matrix 64 rows 62 cols
[2024-05-28 10:19:55] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 10:19:55] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 63/123 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 3/126 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 3 ms to minimize.
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 5/98 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 10:19:56] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 100 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 31/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 5/60 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 63/123 variables, 60/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 3/126 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/126 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 118 constraints, problems are : Problem set: 0 solved, 18 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 7/7 constraints]
After SMT, in 2219ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 917 ms.
Support contains 24 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/62 places, 64/64 transitions.
RANDOM walk for 4000000 steps (895374 resets) in 17738 ms. (225 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19328 resets) in 719 ms. (555 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (19253 resets) in 910 ms. (439 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19122 resets) in 640 ms. (624 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19260 resets) in 635 ms. (628 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19156 resets) in 791 ms. (505 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19302 resets) in 832 ms. (480 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (19367 resets) in 637 ms. (626 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19189 resets) in 645 ms. (619 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (19164 resets) in 982 ms. (406 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1288 ms. (310 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41720 resets) in 798 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41373 resets) in 796 ms. (501 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (40977 resets) in 788 ms. (506 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400000 steps (41284 resets) in 964 ms. (414 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41224 resets) in 1033 ms. (386 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (40986 resets) in 819 ms. (487 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (41393 resets) in 803 ms. (497 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (41421 resets) in 805 ms. (496 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 1607 steps, run visited all 18 properties in 28 ms. (steps per millisecond=57 )
Probabilistic random walk after 1607 steps, saw 842 distinct states, run finished after 35 ms. (steps per millisecond=45 ) properties seen :18
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 75565 ms.
ITS solved all properties within timeout

BK_STOP 1716891609055

--------------------
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 QuasiLiveness -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="SieveSingleMsgMbox-PT-d0m18"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d0m18, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r386-smll-171683818400012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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