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.r590-smll-171734924700017.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 MedleyA-PT-04, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r590-smll-171734924700017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717351686152

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:08:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-02 18:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:08:09] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-06-02 18:08:09] [INFO ] Transformed 115 places.
[2024-06-02 18:08:09] [INFO ] Transformed 107 transitions.
[2024-06-02 18:08:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:08:09] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 338 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 114 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 90 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 49 place count 90 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 61 place count 84 transition count 77
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 67 transition count 60
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 107 place count 61 transition count 60
Applied a total of 107 rules in 111 ms. Remains 61 /115 variables (removed 54) and now considering 60/107 (removed 47) transitions.
// Phase 1: matrix 60 rows 61 cols
[2024-06-02 18:08:09] [INFO ] Computed 8 invariants in 22 ms
[2024-06-02 18:08:09] [INFO ] Implicit Places using invariants in 501 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 573 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 60/115 places, 60/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 59
Applied a total of 2 rules in 6 ms. Remains 59 /60 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 59 cols
[2024-06-02 18:08:09] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 18:08:09] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-02 18:08:09] [INFO ] Invariant cache hit.
[2024-06-02 18:08:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:08:10] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 59/115 places, 59/107 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1100 ms. Remains : 59/115 places, 59/107 transitions.
Discarding 13 transitions out of 59. Remains 46
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (5976 resets) in 2560 ms. (15 steps per ms) remains 24/45 properties
BEST_FIRST walk for 4001 steps (303 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (310 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (315 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (317 resets) in 94 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (325 resets) in 85 ms. (46 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (316 resets) in 64 ms. (61 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (323 resets) in 85 ms. (46 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (291 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (314 resets) in 74 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (332 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (304 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (310 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (320 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (304 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (309 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (298 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (336 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (300 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (287 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (323 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (292 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (305 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (309 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (303 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
[2024-06-02 18:08:12] [INFO ] Invariant cache hit.
[2024-06-02 18:08:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 16/44 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:08:13] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 9 ms to minimize.
[2024-06-02 18:08:13] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 3 ms to minimize.
[2024-06-02 18:08:13] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 10/54 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:08:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 59/113 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 5/118 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:08:14] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/118 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 131 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2617 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 16/44 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 10/54 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:08:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 59/113 variables, 54/121 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-02 18:08:16] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/113 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 5/118 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/118 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/118 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/118 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 0/118 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 157 constraints, problems are : Problem set: 0 solved, 24 unsolved in 1871 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 7/7 constraints]
After SMT, in 4635ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 0 properties in 1299 ms.
Support contains 28 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 59/59 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 54 transition count 49
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 54 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 54 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 12 place count 53 transition count 48
Applied a total of 12 rules in 26 ms. Remains 53 /59 variables (removed 6) and now considering 48/59 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 53/59 places, 48/59 transitions.
RANDOM walk for 4000000 steps (393208 resets) in 20130 ms. (198 steps per ms) remains 19/24 properties
BEST_FIRST walk for 400000 steps (21503 resets) in 1019 ms. (392 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21528 resets) in 1002 ms. (398 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21608 resets) in 1788 ms. (223 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21685 resets) in 1007 ms. (396 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21801 resets) in 1007 ms. (396 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21527 resets) in 1019 ms. (392 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21557 resets) in 1015 ms. (393 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21591 resets) in 1009 ms. (396 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21545 resets) in 1044 ms. (382 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21442 resets) in 1006 ms. (397 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (21396 resets) in 1010 ms. (395 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21473 resets) in 1000 ms. (399 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21510 resets) in 1010 ms. (395 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21448 resets) in 1003 ms. (398 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21538 resets) in 1002 ms. (398 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21377 resets) in 1048 ms. (381 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21661 resets) in 1541 ms. (259 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21523 resets) in 1063 ms. (375 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (19605 resets) in 957 ms. (417 steps per ms) remains 19/19 properties
// Phase 1: matrix 48 rows 53 cols
[2024-06-02 18:08:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 16/45 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:08:31] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 48/93 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 8/101 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 64 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1124 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 8/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 16/45 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 48/93 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 8/101 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 0/101 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 83 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 3/3 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1498 ms.
Support contains 21 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 53/53 places, 48/48 transitions.
RANDOM walk for 4000000 steps (393220 resets) in 27173 ms. (147 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400000 steps (21478 resets) in 1746 ms. (228 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21471 resets) in 1508 ms. (265 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21623 resets) in 1075 ms. (371 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21722 resets) in 1062 ms. (376 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21594 resets) in 1108 ms. (360 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21431 resets) in 1649 ms. (242 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21609 resets) in 1068 ms. (374 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21480 resets) in 1070 ms. (373 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (21533 resets) in 1231 ms. (324 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21637 resets) in 1091 ms. (366 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21569 resets) in 1071 ms. (373 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21476 resets) in 1056 ms. (378 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21555 resets) in 1250 ms. (319 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21544 resets) in 1063 ms. (375 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21630 resets) in 1051 ms. (380 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21566 resets) in 967 ms. (413 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400001 steps (21678 resets) in 948 ms. (421 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400002 steps (21578 resets) in 1396 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400003 steps (19953 resets) in 861 ms. (464 steps per ms) remains 19/19 properties
Finished probabilistic random walk after 2203 steps, run visited all 19 properties in 55 ms. (steps per millisecond=40 )
Probabilistic random walk after 2203 steps, saw 1069 distinct states, run finished after 62 ms. (steps per millisecond=35 ) properties seen :19
Able to resolve query QuasiLiveness after proving 46 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 44993 ms.
ITS solved all properties within timeout

BK_STOP 1717351733744

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r590-smll-171734924700017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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