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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K 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.6K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 103K 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 1716366029115

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-30b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 08:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:20:30] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-22 08:20:30] [INFO ] Transformed 399 places.
[2024-05-22 08:20:30] [INFO ] Transformed 350 transitions.
[2024-05-22 08:20:30] [INFO ] Found NUPN structural information;
[2024-05-22 08:20:30] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 191 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 13 ms.
RANDOM walk for 40000 steps (342 resets) in 2493 ms. (16 steps per ms) remains 108/312 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 108/108 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 108/108 properties
// Phase 1: matrix 350 rows 399 cols
[2024-05-22 08:20:31] [INFO ] Computed 65 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/128 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 199/327 variables, 35/167 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 199/366 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 71/398 variables, 25/391 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 71/462 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 350/749 variables, 399/863 constraints. Problems are: Problem set: 0 solved, 108 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/749 variables, and 863 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5055 ms.
Refiners :[Domain max(s): 399/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 399/399 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, 108/108 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 20/128 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 199/327 variables, 35/167 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 199/366 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 71/398 variables, 25/391 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 71/462 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:20:38] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 21 ms to minimize.
[2024-05-22 08:20:38] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 4 ms to minimize.
[2024-05-22 08:20:38] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 08:20:38] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 08:20:39] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-22 08:20:39] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 14 ms to minimize.
[2024-05-22 08:20:39] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-22 08:20:39] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-22 08:20:39] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 9/471 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 08:20:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 08:20:41] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/749 variables, and 473 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5013 ms.
Refiners :[Domain max(s): 398/399 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/399 constraints, PredecessorRefiner: 0/108 constraints, Known Traps: 11/11 constraints]
After SMT, in 10167ms problems are : Problem set: 0 solved, 108 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 393 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 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 393 transition count 323
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 372 transition count 323
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 372 transition count 314
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 363 transition count 314
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 344 transition count 295
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 344 transition count 295
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 344 transition count 294
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 343 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 328 transition count 279
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 328 transition count 279
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 328 transition count 264
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 326 transition count 263
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 326 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 323 transition count 260
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 246 transition count 183
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 244 transition count 185
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 244 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 243 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 242 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 241 transition count 183
Applied a total of 319 rules in 139 ms. Remains 241 /399 variables (removed 158) and now considering 183/350 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 241/399 places, 183/350 transitions.
RANDOM walk for 4000000 steps (191082 resets) in 45201 ms. (88 steps per ms) remains 104/108 properties
BEST_FIRST walk for 40004 steps (342 resets) in 141 ms. (281 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (388 resets) in 121 ms. (327 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (386 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (375 resets) in 92 ms. (430 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (378 resets) in 95 ms. (416 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (340 resets) in 95 ms. (416 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (361 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (367 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (364 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (355 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (391 resets) in 97 ms. (408 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (342 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (365 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (369 resets) in 87 ms. (454 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (385 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (384 resets) in 93 ms. (425 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (344 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (368 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (379 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (345 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (328 resets) in 92 ms. (430 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (353 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (386 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (373 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (369 resets) in 92 ms. (430 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (353 resets) in 96 ms. (412 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (376 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (367 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (376 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (356 resets) in 87 ms. (454 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (349 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (356 resets) in 87 ms. (454 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (369 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (365 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (369 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (363 resets) in 95 ms. (416 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (388 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (382 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (375 resets) in 88 ms. (449 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (374 resets) in 91 ms. (434 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (358 resets) in 94 ms. (421 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (349 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (352 resets) in 92 ms. (430 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (366 resets) in 87 ms. (454 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (360 resets) in 86 ms. (459 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (356 resets) in 94 ms. (421 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (374 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (335 resets) in 88 ms. (449 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (373 resets) in 89 ms. (444 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (361 resets) in 90 ms. (439 steps per ms) remains 104/104 properties
Finished probabilistic random walk after 550693 steps, run visited all 104 properties in 3587 ms. (steps per millisecond=153 )
Probabilistic random walk after 550693 steps, saw 139263 distinct states, run finished after 3603 ms. (steps per millisecond=152 ) properties seen :104
Able to resolve query StableMarking after proving 313 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 29028 ms.
ITS solved all properties within timeout

BK_STOP 1716366059453

--------------------
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-30b"
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 DES-PT-30b, 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 r100-tall-171624200900443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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