fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r534-smll-171683819200012
Last Updated
July 7, 2024

About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
647.939 54073.00 151142.00 277.80 T normal

Execution Chart

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

Trace from the execution

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

--------------------
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 1717247786304

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:16:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:16:29] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-01 13:16:29] [INFO ] Transformed 262 places.
[2024-06-01 13:16:29] [INFO ] Transformed 73 transitions.
[2024-06-01 13:16:29] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 276 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 30 ms. Remains 70 /262 variables (removed 192) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 70 cols
[2024-06-01 13:16:29] [INFO ] Computed 5 invariants in 12 ms
[2024-06-01 13:16:29] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 13:16:29] [INFO ] Invariant cache hit.
[2024-06-01 13:16:29] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:16:29] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:16:30] [INFO ] Invariant cache hit.
[2024-06-01 13:16:30] [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-06-01 13:16:31] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 26 ms to minimize.
[2024-06-01 13:16:31] [INFO ] Deduced a trap composed of 23 places in 66 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-06-01 13:16:32] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 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 3815 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 3824 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 7940ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 7964ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 8900 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 (8977 resets) in 3521 ms. (11 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4001 steps (186 resets) in 103 ms. (38 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (180 resets) in 83 ms. (47 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4001 steps (181 resets) in 70 ms. (56 steps per ms) remains 32/38 properties
BEST_FIRST walk for 4003 steps (171 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (185 resets) in 68 ms. (58 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (189 resets) in 56 ms. (70 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (179 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (191 resets) in 50 ms. (78 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (207 resets) in 32 ms. (121 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4003 steps (196 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (186 resets) in 47 ms. (83 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (176 resets) in 28 ms. (137 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (188 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (202 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (176 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (183 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (200 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (180 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (194 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (800 resets) in 49 ms. (80 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (423 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (392 resets) in 67 ms. (58 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (407 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (406 resets) in 117 ms. (33 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (400 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (416 resets) in 43 ms. (90 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (408 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (394 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (373 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (401 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (408 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (398 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
[2024-06-01 13:16:39] [INFO ] Invariant cache hit.
[2024-06-01 13:16:39] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 28/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 72/140 variables, 68/73 constraints. Problems are: Problem set: 0 solved, 31 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 30/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 3/143 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 13:16:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
[2024-06-01 13:16:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-06-01 13:16:42] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 109 constraints, problems are : Problem set: 0 solved, 31 unsolved in 2930 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: 31/31 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 28/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 72/140 variables, 68/74 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 3/143 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 19/138 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/143 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 140 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1995 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: 31/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 4990ms problems are : Problem set: 0 solved, 31 unsolved
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 5085 ms.
Support contains 38 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 47 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 52 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 4000000 steps (894966 resets) in 20548 ms. (194 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (19304 resets) in 767 ms. (520 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (19044 resets) in 716 ms. (557 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400003 steps (19213 resets) in 786 ms. (508 steps per ms) remains 27/30 properties
BEST_FIRST walk for 400003 steps (19435 resets) in 678 ms. (589 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400001 steps (19155 resets) in 675 ms. (591 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (19318 resets) in 695 ms. (574 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (19182 resets) in 695 ms. (574 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (19291 resets) in 724 ms. (551 steps per ms) remains 20/27 properties
BEST_FIRST walk for 400002 steps (19191 resets) in 722 ms. (553 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19528 resets) in 743 ms. (537 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19138 resets) in 731 ms. (546 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19326 resets) in 729 ms. (547 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19285 resets) in 729 ms. (547 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19287 resets) in 817 ms. (489 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19437 resets) in 893 ms. (447 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1524 ms. (262 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41826 resets) in 1194 ms. (334 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41935 resets) in 1712 ms. (233 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41051 resets) in 889 ms. (449 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41315 resets) in 860 ms. (464 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41174 resets) in 1169 ms. (341 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (40974 resets) in 1216 ms. (328 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41494 resets) in 1158 ms. (345 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41363 resets) in 1261 ms. (316 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41401 resets) in 950 ms. (420 steps per ms) remains 20/20 properties
// Phase 1: matrix 70 rows 67 cols
[2024-06-01 13:17:03] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 13:17:03] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 33/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 20 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, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 3/137 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 102 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: 67/67 constraints, ReadFeed: 30/30 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 33/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 69/134 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 29/99 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 3/137 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 122 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1220 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: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2514 ms.
Support contains 27 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 68
Iterating global reduction 0 with 2 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 63 transition count 65
Applied a total of 9 rules in 29 ms. Remains 63 /67 variables (removed 4) and now considering 65/70 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 63/67 places, 65/70 transitions.
RANDOM walk for 4000000 steps (894310 resets) in 19213 ms. (208 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19188 resets) in 734 ms. (544 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19176 resets) in 720 ms. (554 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19135 resets) in 720 ms. (554 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19216 resets) in 732 ms. (545 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19264 resets) in 721 ms. (554 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19346 resets) in 712 ms. (561 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19334 resets) in 891 ms. (448 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19442 resets) in 911 ms. (438 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19290 resets) in 716 ms. (557 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19489 resets) in 737 ms. (542 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1236 ms. (323 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41747 resets) in 904 ms. (441 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41874 resets) in 947 ms. (421 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41156 resets) in 911 ms. (438 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41243 resets) in 944 ms. (423 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (40946 resets) in 920 ms. (434 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41202 resets) in 910 ms. (439 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41150 resets) in 909 ms. (439 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (40853 resets) in 900 ms. (443 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (40857 resets) in 921 ms. (433 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 1620 steps, run visited all 20 properties in 48 ms. (steps per millisecond=33 )
Probabilistic random walk after 1620 steps, saw 849 distinct states, run finished after 53 ms. (steps per millisecond=30 ) properties seen :20
Able to resolve query QuasiLiveness after proving 63 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 51533 ms.
ITS solved all properties within timeout

BK_STOP 1717247840377

--------------------
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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is 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 r534-smll-171683819200012"
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 ;