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

About the Execution of GreatSPN+red for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
979.220 138066.00 266024.00 276.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.r320-tall-171662352000068.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 QuasiCertifProtocol-PT-32, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662352000068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 942K May 18 16:43 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 1716752075218

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 19:34:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-26 19:34:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 19:34:36] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-26 19:34:36] [INFO ] Transformed 3806 places.
[2024-05-26 19:34:36] [INFO ] Transformed 506 transitions.
[2024-05-26 19:34:36] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 272 ms.
Structural test allowed to assert that 36 places are NOT stable. Took 13 ms.
RANDOM walk for 40000 steps (1069 resets) in 7065 ms. (5 steps per ms) remains 3669/3770 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 11 ms. (10 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 13 ms. (8 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 10 ms. (11 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 3669/3669 properties
BEST_FIRST walk for 124 steps (0 resets) in 4 ms. (24 steps per ms) remains 3669/3669 properties
Probabilistic random walk after 30001 steps, saw 5953 distinct states, run finished after 1554 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 506 rows 3806 cols
[2024-05-26 19:34:40] [INFO ] Computed 3301 invariants in 165 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3669 variables, 3266/3266 constraints. Problems are: Problem set: 0 solved, 3669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3669/4312 variables, and 3266 constraints, problems are : Problem set: 0 solved, 3669 unsolved in 5148 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 3266/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 3669/3669 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3669 variables, 3266/3266 constraints. Problems are: Problem set: 0 solved, 3669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3669/4312 variables, and 3266 constraints, problems are : Problem set: 0 solved, 3669 unsolved in 5082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 3266/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/3669 constraints, Known Traps: 0/0 constraints]
After SMT, in 10984ms problems are : Problem set: 0 solved, 3669 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3669 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3804 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 3771 transition count 439
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 33 Pre rules applied. Total rules applied 101 place count 3771 transition count 406
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 65 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 131 rules applied. Total rules applied 232 place count 3673 transition count 406
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 232 place count 3673 transition count 405
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 235 place count 3671 transition count 405
Applied a total of 235 rules in 231 ms. Remains 3671 /3806 variables (removed 135) and now considering 405/506 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 3671/3806 places, 405/506 transitions.
RANDOM walk for 1166836 steps (39566 resets) in 120004 ms. (9 steps per ms) remains 2345/3669 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (17 resets) in 39 ms. (100 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 26 ms. (148 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (15 resets) in 29 ms. (133 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (13 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (9 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (10 resets) in 32 ms. (121 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 43 ms. (91 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (13 resets) in 35 ms. (111 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (9 resets) in 27 ms. (143 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (18 resets) in 33 ms. (117 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (14 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (13 resets) in 29 ms. (133 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (20 resets) in 33 ms. (117 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (15 resets) in 29 ms. (133 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (13 resets) in 33 ms. (117 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (17 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (17 resets) in 35 ms. (111 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (14 resets) in 34 ms. (114 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 33 ms. (117 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 39 ms. (100 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (12 resets) in 34 ms. (114 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (9 resets) in 41 ms. (95 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (11 resets) in 29 ms. (133 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 36 ms. (108 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (10 resets) in 37 ms. (105 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4003 steps (11 resets) in 32 ms. (121 steps per ms) remains 2345/2345 properties
BEST_FIRST walk for 4004 steps (16 resets) in 38 ms. (102 steps per ms) remains 2345/2345 properties
// Phase 1: matrix 405 rows 3671 cols
[2024-05-26 19:35:22] [INFO ] Computed 3266 invariants in 49 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2345 variables, 2146/2146 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2345/4076 variables, and 2146 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 45057 ms.
Refiners :[Generalized P Invariants (flows): 2146/3266 constraints, State Equation: 0/3671 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2345 variables, 2146/2146 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-26 19:36:10] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 9 ms to minimize.
[2024-05-26 19:36:10] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-26 19:36:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2345/4076 variables, and 2153 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 45040 ms.
Refiners :[Generalized P Invariants (flows): 2146/3266 constraints, State Equation: 0/3671 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 7/7 constraints]
After SMT, in 90406ms problems are : Problem set: 0 solved, 2345 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2345 out of 3671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3671/3671 places, 405/405 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
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 0 with 138 rules applied. Total rules applied 138 place count 3638 transition count 300
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 140 place count 3636 transition count 300
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 140 place count 3636 transition count 267
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 99 rules applied. Total rules applied 239 place count 3570 transition count 267
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 3570 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 3569 transition count 266
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 1089 places
Reduce places removed 1155 places and 0 transitions.
Iterating global reduction 4 with 1221 rules applied. Total rules applied 1462 place count 2414 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1463 place count 2413 transition count 199
Ensure Unique test removed 33 places
Iterating post reduction 4 with 33 rules applied. Total rules applied 1496 place count 2380 transition count 199
Applied a total of 1496 rules in 318 ms. Remains 2380 /3671 variables (removed 1291) and now considering 199/405 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 2380/3671 places, 199/405 transitions.
RANDOM walk for 3602 steps (23 resets) in 256 ms. (14 steps per ms) remains 0/2345 properties
Able to resolve query StableMarking after proving 3771 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 136879 ms.
ITS solved all properties within timeout

BK_STOP 1716752213284

--------------------
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="QuasiCertifProtocol-PT-32"
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 QuasiCertifProtocol-PT-32, 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 r320-tall-171662352000068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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