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

About the Execution of GreatSPN+red for CloudReconfiguration-PT-302

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
967.460 40855.00 119939.00 155.00 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-171624200200078.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 CloudReconfiguration-PT-302, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-tall-171624200200078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.0K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 11 19:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 19:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 19:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:34 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 660K 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 1716363949169

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudReconfiguration-PT-302
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:45:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-22 07:45:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:45:50] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-22 07:45:50] [INFO ] Transformed 2585 places.
[2024-05-22 07:45:50] [INFO ] Transformed 3095 transitions.
[2024-05-22 07:45:50] [INFO ] Found NUPN structural information;
[2024-05-22 07:45:50] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 265 ms.
Graph (trivial) has 2956 edges and 2585 vertex of which 882 / 2585 are part of one of the 63 SCC in 12 ms
Free SCC test removed 819 places
Structural test allowed to assert that 867 places are NOT stable. Took 46 ms.
Ensure Unique test removed 936 transitions
Reduce redundant transitions removed 936 transitions.
RANDOM walk for 40000 steps (642 resets) in 3926 ms. (10 steps per ms) remains 1291/1718 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 89 ms. (1 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 19 ms. (6 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 24 ms. (4 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 17 ms. (6 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 24 ms. (4 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 11 ms. (10 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 13 ms. (8 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 1291/1291 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 1291/1291 properties
[2024-05-22 07:45:52] [INFO ] Flow matrix only has 2097 transitions (discarded 62 similar events)
// Phase 1: matrix 2097 rows 1766 cols
[2024-05-22 07:45:52] [INFO ] Computed 4 invariants in 27 ms
[2024-05-22 07:45:52] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1291 variables, 1291/1291 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3863 variables, and 1291 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 5112 ms.
Refiners :[Domain max(s): 1291/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1291/1291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1291 variables, 1291/1291 constraints. Problems are: Problem set: 0 solved, 1291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1291/3863 variables, and 1291 constraints, problems are : Problem set: 0 solved, 1291 unsolved in 5023 ms.
Refiners :[Domain max(s): 1291/1766 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/1766 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1291 constraints, Known Traps: 0/0 constraints]
After SMT, in 10676ms problems are : Problem set: 0 solved, 1291 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1291 out of 1766 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1766/1766 places, 2159/2159 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1766 transition count 1797
Reduce places removed 299 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 324 rules applied. Total rules applied 686 place count 1467 transition count 1772
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 6 rules applied. Total rules applied 692 place count 1463 transition count 1770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 693 place count 1462 transition count 1770
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 693 place count 1462 transition count 1755
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 723 place count 1447 transition count 1755
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 743 place count 1427 transition count 1735
Iterating global reduction 4 with 20 rules applied. Total rules applied 763 place count 1427 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 764 place count 1426 transition count 1734
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 1426 transition count 1734
Performed 36 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 837 place count 1390 transition count 1694
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 839 place count 1390 transition count 1692
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 851 place count 1384 transition count 1728
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 861 place count 1384 transition count 1718
Free-agglomeration rule applied 31 times.
Iterating global reduction 5 with 31 rules applied. Total rules applied 892 place count 1384 transition count 1687
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 928 place count 1353 transition count 1682
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 932 place count 1353 transition count 1678
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 933 place count 1353 transition count 1678
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 937 place count 1353 transition count 1678
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 938 place count 1353 transition count 1677
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 939 place count 1352 transition count 1676
Applied a total of 939 rules in 465 ms. Remains 1352 /1766 variables (removed 414) and now considering 1676/2159 (removed 483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 1352/1766 places, 1676/2159 transitions.
RANDOM walk for 4000000 steps (23349 resets) in 68095 ms. (58 steps per ms) remains 16/1291 properties
BEST_FIRST walk for 400003 steps (739 resets) in 1095 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400004 steps (778 resets) in 1513 ms. (264 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400003 steps (733 resets) in 650 ms. (614 steps per ms) remains 16/16 properties
BEST_FIRST walk for 400002 steps (654 resets) in 662 ms. (603 steps per ms) remains 12/16 properties
BEST_FIRST walk for 400000 steps (738 resets) in 1003 ms. (398 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (727 resets) in 825 ms. (484 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (743 resets) in 474 ms. (842 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (734 resets) in 480 ms. (831 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (739 resets) in 499 ms. (800 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400002 steps (784 resets) in 472 ms. (845 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (729 resets) in 477 ms. (836 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (736 resets) in 514 ms. (776 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400004 steps (769 resets) in 478 ms. (835 steps per ms) remains 12/12 properties
BEST_FIRST walk for 400001 steps (724 resets) in 479 ms. (833 steps per ms) remains 12/12 properties
[2024-05-22 07:46:25] [INFO ] Flow matrix only has 1674 transitions (discarded 2 similar events)
// Phase 1: matrix 1674 rows 1352 cols
[2024-05-22 07:46:25] [INFO ] Computed 4 invariants in 17 ms
[2024-05-22 07:46:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 400/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 940/1352 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1352 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1674/3026 variables, 1352/1356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3026 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3026 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/3026 variables, 0/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3026/3026 variables, and 1357 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2078 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1352/1352 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 400/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 940/1352 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1352 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1674/3026 variables, 1352/1356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3026 variables, 1/1357 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3026 variables, 12/1369 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3026 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/3026 variables, 0/1369 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3026/3026 variables, and 1369 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2616 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1352/1352 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 4735ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 3418 steps, including 73 resets, run visited all 12 properties in 73 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 12 properties in 91 ms.
Able to resolve query StableMarking after proving 1720 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 39695 ms.
ITS solved all properties within timeout

BK_STOP 1716363990024

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.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="CloudReconfiguration-PT-302"
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 CloudReconfiguration-PT-302, 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-171624200200078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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