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-171683819200017.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-d0m36, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819200017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 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 1717247857244

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-d0m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:17:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 13:17:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:17:40] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-06-01 13:17:40] [INFO ] Transformed 262 places.
[2024-06-01 13:17:40] [INFO ] Transformed 73 transitions.
[2024-06-01 13:17:40] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 392 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 41 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:17:40] [INFO ] Computed 5 invariants in 29 ms
[2024-06-01 13:17:40] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-01 13:17:40] [INFO ] Invariant cache hit.
[2024-06-01 13:17:40] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:17:41] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-06-01 13:17:41] [INFO ] Invariant cache hit.
[2024-06-01 13:17:41] [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:17:42] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 15 ms to minimize.
[2024-06-01 13:17:42] [INFO ] Deduced a trap composed of 23 places in 55 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
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 108 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4053 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: 2/2 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, 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, 72/180 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-06-01 13:17:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (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 4682 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 9013ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9040ms
Starting structural reductions in LIVENESS mode, iteration 1 : 70/262 places, 73/73 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 10009 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 (8886 resets) in 2925 ms. (13 steps per ms) remains 39/62 properties
BEST_FIRST walk for 4002 steps (184 resets) in 74 ms. (53 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (193 resets) in 51 ms. (76 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (172 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (180 resets) in 75 ms. (52 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (214 resets) in 93 ms. (42 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (186 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (184 resets) in 31 ms. (125 steps per ms) remains 35/39 properties
BEST_FIRST walk for 4002 steps (200 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (200 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (198 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (202 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (209 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (185 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (186 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (203 resets) in 28 ms. (138 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (195 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (199 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (199 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (202 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (180 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (800 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (408 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (404 resets) in 59 ms. (66 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (422 resets) in 63 ms. (62 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (421 resets) in 87 ms. (45 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (382 resets) in 65 ms. (60 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (409 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (416 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (414 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (391 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (434 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (422 resets) in 44 ms. (88 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (424 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (414 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
[2024-06-01 13:17:51] [INFO ] Invariant cache hit.
[2024-06-01 13:17:51] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 25/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 34 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, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 2/143 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 106 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1478 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: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 25/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/69 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 72/141 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 30/104 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 2/143 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/143 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 140 constraints, problems are : Problem set: 0 solved, 34 unsolved in 2367 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: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 3903ms problems are : Problem set: 0 solved, 34 unsolved
Parikh walk visited 3 properties in 3624 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 33 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 33 ms. Remains : 67/70 places, 70/73 transitions.
RANDOM walk for 4000000 steps (894556 resets) in 21822 ms. (183 steps per ms) remains 24/31 properties
BEST_FIRST walk for 400001 steps (19499 resets) in 715 ms. (558 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (19072 resets) in 712 ms. (561 steps per ms) remains 22/24 properties
BEST_FIRST walk for 400002 steps (19261 resets) in 802 ms. (498 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (19331 resets) in 782 ms. (510 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (19257 resets) in 802 ms. (498 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (19334 resets) in 798 ms. (500 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400002 steps (19212 resets) in 730 ms. (547 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19000 resets) in 727 ms. (549 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19451 resets) in 712 ms. (561 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19152 resets) in 918 ms. (435 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19169 resets) in 905 ms. (441 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19287 resets) in 705 ms. (566 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19285 resets) in 703 ms. (568 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1150 ms. (347 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (42016 resets) in 952 ms. (419 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41167 resets) in 950 ms. (420 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41279 resets) in 1278 ms. (312 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41133 resets) in 1062 ms. (376 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41373 resets) in 958 ms. (417 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41307 resets) in 959 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41231 resets) in 959 ms. (416 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41378 resets) in 1005 ms. (397 steps per ms) remains 20/20 properties
// Phase 1: matrix 70 rows 67 cols
[2024-06-01 13:18:12] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 13:18:12] [INFO ] State equation strengthened by 30 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) 33/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/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 637 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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 6/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, 8/107 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 3/137 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 12/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 1595 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 2260ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 2853 ms.
Support contains 26 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 70/70 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 64 transition count 67
Iterating global reduction 0 with 3 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
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 62 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 62 transition count 64
Applied a total of 11 rules in 18 ms. Remains 62 /67 variables (removed 5) and now considering 64/70 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 62/67 places, 64/70 transitions.
RANDOM walk for 4000000 steps (893878 resets) in 20170 ms. (198 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19167 resets) in 720 ms. (554 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19137 resets) in 940 ms. (425 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19326 resets) in 903 ms. (442 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19335 resets) in 861 ms. (464 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19049 resets) in 989 ms. (404 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (19334 resets) in 744 ms. (536 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (19124 resets) in 738 ms. (541 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19225 resets) in 735 ms. (543 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19328 resets) in 932 ms. (428 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (19234 resets) in 878 ms. (455 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (19124 resets) in 880 ms. (454 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400000 steps (80000 resets) in 1105 ms. (361 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41720 resets) in 908 ms. (440 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41276 resets) in 918 ms. (435 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (41414 resets) in 979 ms. (408 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41176 resets) in 923 ms. (432 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400001 steps (41134 resets) in 883 ms. (452 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41169 resets) in 947 ms. (421 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41120 resets) in 897 ms. (445 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (41026 resets) in 889 ms. (449 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 1607 steps, run visited all 20 properties in 44 ms. (steps per millisecond=36 )
Probabilistic random walk after 1607 steps, saw 842 distinct states, run finished after 50 ms. (steps per millisecond=32 ) properties seen :20
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 50133 ms.
ITS solved all properties within timeout

BK_STOP 1717247909924

--------------------
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-d0m36"
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-d0m36, 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-171683819200017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m36.tgz
mv SieveSingleMsgMbox-PT-d0m36 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 ;