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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
448.027 31551.00 87212.00 67.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-171624201000453.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-40b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624201000453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 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 115K 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 1716366516189

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-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:28:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 08:28:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:28:37] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 08:28:37] [INFO ] Transformed 439 places.
[2024-05-22 08:28:37] [INFO ] Transformed 390 transitions.
[2024-05-22 08:28:37] [INFO ] Found NUPN structural information;
[2024-05-22 08:28:37] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 192 ms.
Structural test allowed to assert that 87 places are NOT stable. Took 14 ms.
RANDOM walk for 40000 steps (337 resets) in 2424 ms. (16 steps per ms) remains 146/352 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 146/146 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 146/146 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 146/146 properties
// Phase 1: matrix 390 rows 439 cols
[2024-05-22 08:28:38] [INFO ] Computed 65 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 22/168 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 22/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 199/367 variables, 35/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 199/406 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 71/438 variables, 25/431 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 71/502 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/829 variables, and 502 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5067 ms.
Refiners :[Domain max(s): 438/439 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 22/168 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 22/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 199/367 variables, 35/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 199/406 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 71/438 variables, 25/431 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 71/502 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 08:28:46] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 15 ms to minimize.
[2024-05-22 08:28:46] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-22 08:28:46] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 08:28:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 13 ms to minimize.
[2024-05-22 08:28:48] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 5/507 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 08:28:48] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/829 variables, and 508 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5016 ms.
Refiners :[Domain max(s): 438/439 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 0/146 constraints, Known Traps: 6/6 constraints]
After SMT, in 10186ms problems are : Problem set: 0 solved, 146 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 146 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 390/390 transitions.
Graph (complete) has 978 edges and 439 vertex of which 433 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 433 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 412 transition count 363
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 412 transition count 354
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 403 transition count 354
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 384 transition count 335
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 384 transition count 335
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 384 transition count 334
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 383 transition count 334
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 368 transition count 319
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 368 transition count 319
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 368 transition count 304
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 366 transition count 303
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 366 transition count 300
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 363 transition count 300
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 286 transition count 223
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 284 transition count 225
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 284 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 283 transition count 224
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 282 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 319 place count 281 transition count 223
Applied a total of 319 rules in 138 ms. Remains 281 /439 variables (removed 158) and now considering 223/390 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 281/439 places, 223/390 transitions.
RANDOM walk for 4000000 steps (191678 resets) in 43310 ms. (92 steps per ms) remains 142/146 properties
BEST_FIRST walk for 40002 steps (340 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (361 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (361 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (380 resets) in 110 ms. (360 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (369 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (373 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (350 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (354 resets) in 109 ms. (363 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (367 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (381 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (374 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40001 steps (357 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (361 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (369 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (384 resets) in 108 ms. (366 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (358 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (359 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (378 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (378 resets) in 109 ms. (363 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (350 resets) in 102 ms. (388 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (350 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (374 resets) in 108 ms. (367 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (368 resets) in 109 ms. (363 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (364 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (379 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (351 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (364 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (381 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (352 resets) in 108 ms. (367 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (362 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (357 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (391 resets) in 108 ms. (367 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (377 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (362 resets) in 102 ms. (388 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (375 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (359 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (347 resets) in 108 ms. (367 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (378 resets) in 103 ms. (384 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (383 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (372 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (377 resets) in 107 ms. (370 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (362 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (369 resets) in 109 ms. (363 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (338 resets) in 111 ms. (357 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (351 resets) in 106 ms. (373 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (360 resets) in 104 ms. (380 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (349 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (366 resets) in 110 ms. (360 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (388 resets) in 108 ms. (366 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (356 resets) in 105 ms. (377 steps per ms) remains 142/142 properties
Finished probabilistic random walk after 740561 steps, run visited all 142 properties in 5679 ms. (steps per millisecond=130 )
Probabilistic random walk after 740561 steps, saw 186859 distinct states, run finished after 5691 ms. (steps per millisecond=130 ) properties seen :142
Able to resolve query StableMarking after proving 353 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 30372 ms.
ITS solved all properties within timeout

BK_STOP 1716366547740

--------------------
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-40b"
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-40b, 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-171624201000453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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