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.r482-tall-171624201900423.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 DES-PT-10b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r482-tall-171624201900423
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 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 StableMarking

=== Now, execution of the tool begins

BK_START 1717179871144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:24:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 18:24:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:24:32] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-31 18:24:32] [INFO ] Transformed 320 places.
[2024-05-31 18:24:32] [INFO ] Transformed 271 transitions.
[2024-05-31 18:24:32] [INFO ] Found NUPN structural information;
[2024-05-31 18:24:32] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 175 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (330 resets) in 2132 ms. (18 steps per ms) remains 29/233 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
// Phase 1: matrix 271 rows 320 cols
[2024-05-31 18:24:33] [INFO ] Computed 65 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/49 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 199/248 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 71/319 variables, 25/312 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 71/383 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1/320 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (OVERLAPS) 271/591 variables, 320/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 705 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1608 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 20/49 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 199/248 variables, 35/88 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 199/287 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:35] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 71/319 variables, 25/313 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 71/384 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:35] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2024-05-31 18:24:36] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 2 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 2 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 2 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 16/405 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-31 18:24:37] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 16 (OVERLAPS) 1/320 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 19 (OVERLAPS) 271/591 variables, 320/729 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/591 variables, 29/758 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:24:39] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2024-05-31 18:24:40] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
SMT process timed out in 6691ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 314 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 314 transition count 244
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 293 transition count 244
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 293 transition count 235
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 284 transition count 235
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 265 transition count 216
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 265 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 265 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 264 transition count 215
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 249 transition count 200
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 249 transition count 200
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 249 transition count 185
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 247 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 247 transition count 181
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 244 transition count 181
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 167 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 165 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 165 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 164 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 163 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 162 transition count 104
Applied a total of 319 rules in 99 ms. Remains 162 /320 variables (removed 158) and now considering 104/271 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 162/320 places, 104/271 transitions.
RANDOM walk for 4000000 steps (191009 resets) in 19491 ms. (205 steps per ms) remains 25/29 properties
BEST_FIRST walk for 400003 steps (3587 resets) in 549 ms. (727 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3670 resets) in 533 ms. (749 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3678 resets) in 534 ms. (747 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3563 resets) in 535 ms. (746 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3622 resets) in 570 ms. (700 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3558 resets) in 553 ms. (722 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400001 steps (3672 resets) in 541 ms. (738 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3545 resets) in 538 ms. (742 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400003 steps (3663 resets) in 539 ms. (740 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (3708 resets) in 543 ms. (735 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (3504 resets) in 541 ms. (738 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (3609 resets) in 534 ms. (747 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3689 resets) in 539 ms. (740 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3566 resets) in 537 ms. (743 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3674 resets) in 533 ms. (749 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (3693 resets) in 531 ms. (751 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (3737 resets) in 535 ms. (746 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3588 resets) in 529 ms. (754 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3709 resets) in 531 ms. (751 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3566 resets) in 623 ms. (641 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3747 resets) in 532 ms. (750 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (3580 resets) in 532 ms. (750 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (3607 resets) in 534 ms. (747 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400002 steps (3711 resets) in 530 ms. (753 steps per ms) remains 24/24 properties
// Phase 1: matrix 104 rows 162 cols
[2024-05-31 18:24:49] [INFO ] Computed 64 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 21/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 38/83 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 35/118 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 25/143 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 7/150 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 100/250 variables, 150/209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 14/264 variables, 10/219 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 2/266 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (OVERLAPS) 0/266 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 226 constraints, problems are : Problem set: 0 solved, 24 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 21/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 38/83 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 35/118 variables, 23/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 18:24:50] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-31 18:24:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 18:24:50] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-31 18:24:50] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 5 ms to minimize.
[2024-05-31 18:24:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 25/143 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 7/150 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 100/250 variables, 150/214 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 14/264 variables, 10/244 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/264 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/264 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 20 (OVERLAPS) 2/266 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/266 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 18:24:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/266 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/266 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-31 18:24:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/266 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/266 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 26 (OVERLAPS) 0/266 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 257 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2726 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 7/7 constraints]
After SMT, in 3608ms problems are : Problem set: 0 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 1 properties in 1466 ms.
Support contains 23 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 162/162 places, 104/104 transitions.
RANDOM walk for 4000000 steps (191070 resets) in 20839 ms. (191 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (3664 resets) in 581 ms. (687 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3662 resets) in 585 ms. (682 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3743 resets) in 583 ms. (684 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3688 resets) in 582 ms. (686 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3704 resets) in 589 ms. (677 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3667 resets) in 586 ms. (681 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (3633 resets) in 581 ms. (687 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3697 resets) in 582 ms. (686 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3682 resets) in 582 ms. (686 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3711 resets) in 586 ms. (681 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (3654 resets) in 602 ms. (663 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3609 resets) in 597 ms. (668 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3608 resets) in 595 ms. (671 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3617 resets) in 606 ms. (658 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3574 resets) in 598 ms. (667 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3629 resets) in 590 ms. (676 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3699 resets) in 620 ms. (644 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3685 resets) in 604 ms. (661 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (3634 resets) in 616 ms. (648 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3564 resets) in 614 ms. (650 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (3647 resets) in 603 ms. (662 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (3678 resets) in 607 ms. (657 steps per ms) remains 22/22 properties
Finished probabilistic random walk after 180623 steps, run visited all 22 properties in 933 ms. (steps per millisecond=193 )
Probabilistic random walk after 180623 steps, saw 46776 distinct states, run finished after 939 ms. (steps per millisecond=192 ) properties seen :22
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 32897 ms.
ITS solved all properties within timeout

BK_STOP 1717179905155

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="DES-PT-10b"
export BK_EXAMINATION="StableMarking"
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 DES-PT-10b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r482-tall-171624201900423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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