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.r144-tall-171631143900338.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-003, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-tall-171631143900338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 50K 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 1716406214113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 19:30:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 19:30:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 19:30:15] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-22 19:30:15] [INFO ] Transformed 163 places.
[2024-05-22 19:30:15] [INFO ] Transformed 148 transitions.
[2024-05-22 19:30:15] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 154 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 6 ms.
RANDOM walk for 40000 steps (1337 resets) in 2253 ms. (17 steps per ms) remains 108/152 properties
BEST_FIRST walk for 402 steps (8 resets) in 32 ms. (12 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 21 ms. (18 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 25 ms. (15 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 19 ms. (20 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 16 ms. (23 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (9 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (10 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 12 ms. (30 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (9 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 16 ms. (23 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (10 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (9 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (11 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 16 ms. (23 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (10 resets) in 5 ms. (66 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (10 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (12 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 13 ms. (28 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 400 steps (12 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 401 steps (11 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
// Phase 1: matrix 148 rows 163 cols
[2024-05-22 19:30:16] [INFO ] Computed 19 invariants in 26 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 5/163 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 148/311 variables, 163/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 182 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3308 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 50/158 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 17 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 14 ms to minimize.
[2024-05-22 19:30:20] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:21] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:22] [INFO ] Deduced a trap composed of 99 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 5/163 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 64 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-22 19:30:23] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 2 ms to minimize.
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 19:30:24] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
SMT process timed out in 8426ms, After SMT, problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 163 transition count 139
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 154 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 154 transition count 137
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 152 transition count 137
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 138 transition count 123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 136 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 136 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 135 transition count 122
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 59 place count 135 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 134 transition count 121
Applied a total of 60 rules in 82 ms. Remains 134 /163 variables (removed 29) and now considering 121/148 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 134/163 places, 121/148 transitions.
RANDOM walk for 4000000 steps (509615 resets) in 29367 ms. (136 steps per ms) remains 70/108 properties
BEST_FIRST walk for 400001 steps (33677 resets) in 1984 ms. (201 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33848 resets) in 1787 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33593 resets) in 1930 ms. (207 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33699 resets) in 1719 ms. (232 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33834 resets) in 1774 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33974 resets) in 2645 ms. (151 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33675 resets) in 1833 ms. (218 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33749 resets) in 1943 ms. (205 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33700 resets) in 1801 ms. (221 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33706 resets) in 2662 ms. (150 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33866 resets) in 1931 ms. (207 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33727 resets) in 1795 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33863 resets) in 2004 ms. (199 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33846 resets) in 1773 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33604 resets) in 2191 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33755 resets) in 1857 ms. (215 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33846 resets) in 1860 ms. (214 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33937 resets) in 2172 ms. (184 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33914 resets) in 1891 ms. (211 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33524 resets) in 1876 ms. (213 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33667 resets) in 2021 ms. (197 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33756 resets) in 1761 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33861 resets) in 1916 ms. (208 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33618 resets) in 1873 ms. (213 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33541 resets) in 1743 ms. (229 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33922 resets) in 2393 ms. (167 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33861 resets) in 1757 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33843 resets) in 1870 ms. (213 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33711 resets) in 1958 ms. (204 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33695 resets) in 1787 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33905 resets) in 1895 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33797 resets) in 1731 ms. (230 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33872 resets) in 2097 ms. (190 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33816 resets) in 1791 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33802 resets) in 1821 ms. (219 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33510 resets) in 1811 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33826 resets) in 1791 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33698 resets) in 1813 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33645 resets) in 2107 ms. (189 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33715 resets) in 1946 ms. (205 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33567 resets) in 2159 ms. (185 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33733 resets) in 2018 ms. (198 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33740 resets) in 2187 ms. (182 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33972 resets) in 1928 ms. (207 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33723 resets) in 1827 ms. (218 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33687 resets) in 2022 ms. (197 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33826 resets) in 1774 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33690 resets) in 1777 ms. (224 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33632 resets) in 1790 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33709 resets) in 1980 ms. (201 steps per ms) remains 70/70 properties
// Phase 1: matrix 121 rows 134 cols
[2024-05-22 19:31:05] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 19:31:05] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 14/134 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 121/255 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 155 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1822 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 46/116 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/120 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 14/134 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 3 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-22 19:31:08] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 2 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 19:31:09] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
[2024-05-22 19:31:10] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 121/255 variables, 134/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 70/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 15 (OVERLAPS) 0/255 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 250 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 134/134 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 25/25 constraints]
After SMT, in 6926ms problems are : Problem set: 0 solved, 70 unsolved
Fused 70 Parikh solutions to 67 different solutions.
Parikh walk visited 0 properties in 5616 ms.
Support contains 70 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 121/121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 134 transition count 113
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 126 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 126 transition count 112
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 125 transition count 112
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 34 place count 117 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 36 place count 116 transition count 104
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 116 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 115 transition count 103
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 42 place count 115 transition count 103
Applied a total of 42 rules in 31 ms. Remains 115 /134 variables (removed 19) and now considering 103/121 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 115/134 places, 103/121 transitions.
RANDOM walk for 4000000 steps (512768 resets) in 22599 ms. (176 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (34110 resets) in 1957 ms. (204 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33945 resets) in 1983 ms. (201 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33788 resets) in 1456 ms. (274 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33792 resets) in 1426 ms. (280 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33776 resets) in 1435 ms. (278 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (34066 resets) in 1446 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33896 resets) in 1463 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33644 resets) in 1472 ms. (271 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33971 resets) in 1465 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33890 resets) in 1457 ms. (274 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33925 resets) in 1449 ms. (275 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33843 resets) in 1464 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33798 resets) in 1445 ms. (276 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33988 resets) in 1467 ms. (272 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33913 resets) in 1850 ms. (216 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34030 resets) in 1847 ms. (216 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33871 resets) in 1915 ms. (208 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33841 resets) in 1892 ms. (211 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33824 resets) in 1853 ms. (215 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33795 resets) in 1874 ms. (213 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33754 resets) in 1882 ms. (212 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33839 resets) in 2416 ms. (165 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33851 resets) in 1823 ms. (219 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33870 resets) in 1810 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33919 resets) in 1952 ms. (204 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33808 resets) in 1963 ms. (203 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33918 resets) in 1789 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33972 resets) in 1978 ms. (202 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33967 resets) in 1793 ms. (222 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33734 resets) in 1876 ms. (213 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33820 resets) in 2054 ms. (194 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34006 resets) in 1786 ms. (223 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33835 resets) in 1834 ms. (217 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33997 resets) in 2038 ms. (196 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (33857 resets) in 1760 ms. (227 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33937 resets) in 1816 ms. (220 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33946 resets) in 2021 ms. (197 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33824 resets) in 1806 ms. (221 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400004 steps (33847 resets) in 1832 ms. (218 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33958 resets) in 1853 ms. (215 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (34107 resets) in 1862 ms. (214 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34023 resets) in 1769 ms. (225 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33887 resets) in 2238 ms. (178 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (33782 resets) in 1926 ms. (207 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (34187 resets) in 1898 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400001 steps (34033 resets) in 1699 ms. (235 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33926 resets) in 1487 ms. (268 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (33878 resets) in 1678 ms. (238 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400002 steps (33918 resets) in 1463 ms. (273 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400000 steps (33923 resets) in 1464 ms. (273 steps per ms) remains 70/70 properties
Finished probabilistic random walk after 1960796 steps, run visited all 70 properties in 9124 ms. (steps per millisecond=214 )
Probabilistic random walk after 1960796 steps, saw 980563 distinct states, run finished after 9131 ms. (steps per millisecond=214 ) properties seen :70
Able to resolve query StableMarking after proving 153 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 107592 ms.
ITS solved all properties within timeout

BK_STOP 1716406322853

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 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="DoubleExponent-PT-003"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-003, 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 r144-tall-171631143900338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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