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

About the Execution of GreatSPN+red for CO4-PT-21

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
174.775 1651.00 2190.00 12.60 T 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.r560-tall-171734905700101.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 CO4-PT-21, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 344K Jun 2 16:33 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717351542189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-02 18:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:05:43] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-06-02 18:05:43] [INFO ] Transformed 1400 places.
[2024-06-02 18:05:43] [INFO ] Transformed 1583 transitions.
[2024-06-02 18:05:43] [INFO ] Found NUPN structural information;
[2024-06-02 18:05:43] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 217 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 307 places in 15 ms
Reduce places removed 307 places and 347 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.22801KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Graph (trivial) has 1121 edges and 1093 vertex of which 3 / 1093 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 41 stabilizing places and 42 stable transitions
Graph (complete) has 1469 edges and 1091 vertex of which 1040 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.16 ms
Discarding 51 places :
Also discarding 34 output transitions
Drop transitions (Output transitions of discarded places.) removed 34 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 41 stabilizing places and 42 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 679 transitions
Trivial Post-agglo rules discarded 679 transitions
Performed 679 trivial Post agglomeration. Transition count delta: 679
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1040 transition count 519
Reduce places removed 679 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 691 rules applied. Total rules applied 1374 place count 361 transition count 507
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Iterating post reduction 2 with 10 rules applied. Total rules applied 1384 place count 355 transition count 503
Computed a total of 26 stabilizing places and 27 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1384 place count 355 transition count 502
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1386 place count 354 transition count 502
Computed a total of 25 stabilizing places and 26 stable transitions
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1428 place count 312 transition count 460
Iterating global reduction 3 with 42 rules applied. Total rules applied 1470 place count 312 transition count 460
Computed a total of 17 stabilizing places and 18 stable transitions
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1470 place count 312 transition count 444
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1502 place count 296 transition count 444
Computed a total of 17 stabilizing places and 18 stable transitions
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1530 place count 268 transition count 416
Iterating global reduction 3 with 28 rules applied. Total rules applied 1558 place count 268 transition count 416
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 15 stabilizing places and 16 stable 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 3 with 4 rules applied. Total rules applied 1562 place count 268 transition count 412
Reduce places removed 1 places and 0 transitions.
Computed a total of 15 stabilizing places and 16 stable transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 1563 place count 267 transition count 412
Computed a total of 15 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1564 place count 266 transition count 410
Iterating global reduction 5 with 1 rules applied. Total rules applied 1565 place count 266 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 15 stabilizing places and 16 stable transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1566 place count 266 transition count 409
Computed a total of 15 stabilizing places and 16 stable transitions
Performed 123 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 6 with 246 rules applied. Total rules applied 1812 place count 143 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 6 with 4 rules applied. Total rules applied 1816 place count 143 transition count 258
Computed a total of 9 stabilizing places and 10 stable transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 1906 place count 98 transition count 261
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 7 with 30 rules applied. Total rules applied 1936 place count 98 transition count 231
Computed a total of 9 stabilizing places and 10 stable transitions
Discarding 40 places :
Symmetric choice reduction at 8 with 40 rule applications. Total rules 1976 place count 58 transition count 151
Iterating global reduction 8 with 40 rules applied. Total rules applied 2016 place count 58 transition count 151
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 8 with 27 rules applied. Total rules applied 2043 place count 58 transition count 124
Computed a total of 9 stabilizing places and 10 stable transitions
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 2053 place count 48 transition count 95
Iterating global reduction 9 with 10 rules applied. Total rules applied 2063 place count 48 transition count 95
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 9 with 7 rules applied. Total rules applied 2070 place count 48 transition count 88
Computed a total of 9 stabilizing places and 10 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2072 place count 47 transition count 96
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 10 with 12 rules applied. Total rules applied 2084 place count 47 transition count 84
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2085 place count 46 transition count 83
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Applied a total of 2085 rules in 237 ms. Remains 46 /1093 variables (removed 1047) and now considering 83/1236 (removed 1153) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 248 ms. Remains : 46/1093 places, 83/1236 transitions.
Finished random walk after 22 steps, including 1 resets, run found a deadlock after 1 ms. (steps per millisecond=22 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 557 ms.
ITS solved all properties within timeout

BK_STOP 1717351543840

--------------------
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 ReachabilityDeadlock -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="CO4-PT-21"
export BK_EXAMINATION="ReachabilityDeadlock"
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 CO4-PT-21, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r560-tall-171734905700101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;