fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r100-tall-171624201000473
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DES-PT-60b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
467.044 41390.00 113667.00 88.60 F normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 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 139K 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 1716367836137

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-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:50:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 08:50:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:50:37] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-22 08:50:37] [INFO ] Transformed 519 places.
[2024-05-22 08:50:37] [INFO ] Transformed 470 transitions.
[2024-05-22 08:50:37] [INFO ] Found NUPN structural information;
[2024-05-22 08:50:37] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 190 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 10 ms.
RANDOM walk for 40000 steps (340 resets) in 2460 ms. (16 steps per ms) remains 228/432 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 228/228 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 228/228 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 228/228 properties
// Phase 1: matrix 470 rows 519 cols
[2024-05-22 08:50:38] [INFO ] Computed 65 invariants in 49 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 228/228 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 20/248 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 199/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 199/486 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/989 variables, and 486 constraints, problems are : Problem set: 0 solved, 228 unsolved in 5042 ms.
Refiners :[Domain max(s): 447/519 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/519 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 228/228 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 20/248 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 20/252 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 199/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 199/486 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 08:50:46] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 17 ms to minimize.
[2024-05-22 08:50:46] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 4 ms to minimize.
[2024-05-22 08:50:46] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/989 variables, and 489 constraints, problems are : Problem set: 0 solved, 228 unsolved in 5010 ms.
Refiners :[Domain max(s): 447/519 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 0/26 constraints, State Equation: 0/519 constraints, PredecessorRefiner: 0/228 constraints, Known Traps: 3/3 constraints]
After SMT, in 10179ms problems are : Problem set: 0 solved, 228 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 228 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 513 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 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 513 transition count 443
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 492 transition count 443
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 492 transition count 434
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 483 transition count 434
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 464 transition count 415
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 464 transition count 415
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 464 transition count 414
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 463 transition count 414
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 448 transition count 399
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 448 transition count 399
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 448 transition count 384
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 446 transition count 383
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 446 transition count 380
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 443 transition count 380
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 2 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 366 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 364 transition count 305
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 364 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 363 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 362 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 361 transition count 303
Applied a total of 319 rules in 223 ms. Remains 361 /519 variables (removed 158) and now considering 303/470 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 361/519 places, 303/470 transitions.
RANDOM walk for 4000000 steps (191397 resets) in 64461 ms. (62 steps per ms) remains 222/228 properties
BEST_FIRST walk for 40003 steps (368 resets) in 141 ms. (281 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (341 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (352 resets) in 165 ms. (240 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (373 resets) in 129 ms. (307 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (368 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (376 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (362 resets) in 130 ms. (305 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (360 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (370 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (381 resets) in 131 ms. (303 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (376 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (358 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (378 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (380 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (373 resets) in 128 ms. (310 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (374 resets) in 129 ms. (307 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (376 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40001 steps (359 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (364 resets) in 129 ms. (307 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (370 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (383 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (369 resets) in 129 ms. (307 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (357 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (334 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (361 resets) in 123 ms. (322 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (334 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (351 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (357 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (366 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (373 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40001 steps (368 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (376 resets) in 131 ms. (303 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (364 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (376 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (380 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (352 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40001 steps (361 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (355 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (372 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (361 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (367 resets) in 130 ms. (305 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (365 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (368 resets) in 126 ms. (314 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (372 resets) in 130 ms. (305 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (376 resets) in 124 ms. (320 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40003 steps (366 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (355 resets) in 128 ms. (310 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40004 steps (346 resets) in 125 ms. (317 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (366 resets) in 127 ms. (312 steps per ms) remains 222/222 properties
BEST_FIRST walk for 40002 steps (343 resets) in 133 ms. (298 steps per ms) remains 222/222 properties
Finished probabilistic random walk after 1276048 steps, run visited all 222 properties in 9970 ms. (steps per millisecond=127 )
Probabilistic random walk after 1276048 steps, saw 334588 distinct states, run finished after 9992 ms. (steps per millisecond=127 ) properties seen :222
Able to resolve query StableMarking after proving 433 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 40199 ms.
ITS solved all properties within timeout

BK_STOP 1716367877527

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-60b"
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-60b, 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-171624201000473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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