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

About the Execution of LTSMin+red for CO4-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
173.792 1658.00 2136.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.r564-tall-171734907500061.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 ltsminxred
Input is CO4-PT-13, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907500061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K 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 191K 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 1717361459178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CO4-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:51:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-02 20:51:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:51:00] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 20:51:00] [INFO ] Transformed 649 places.
[2024-06-02 20:51:00] [INFO ] Transformed 816 transitions.
[2024-06-02 20:51:00] [INFO ] Found NUPN structural information;
[2024-06-02 20:51:00] [INFO ] Parsed PT model containing 649 places and 816 transitions and 2232 arcs in 242 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 172 places in 17 ms
Reduce places removed 172 places and 227 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.17045KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 477/477 places, 589/589 transitions.
Graph (trivial) has 483 edges and 477 vertex of which 3 / 477 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 47 stabilizing places and 69 stable transitions
Graph (complete) has 875 edges and 475 vertex of which 445 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.10 ms
Discarding 30 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 47 stabilizing places and 69 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 445 transition count 298
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Computed a total of 31 stabilizing places and 53 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 288 rules applied. Total rules applied 562 place count 175 transition count 280
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 31 stabilizing places and 53 stable transitions
Iterating post reduction 2 with 14 rules applied. Total rules applied 576 place count 167 transition count 274
Computed a total of 31 stabilizing places and 53 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 576 place count 167 transition count 273
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 578 place count 166 transition count 273
Computed a total of 30 stabilizing places and 52 stable transitions
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 605 place count 139 transition count 244
Iterating global reduction 3 with 27 rules applied. Total rules applied 632 place count 139 transition count 244
Computed a total of 20 stabilizing places and 42 stable transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 632 place count 139 transition count 239
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 642 place count 134 transition count 239
Computed a total of 20 stabilizing places and 42 stable transitions
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 659 place count 117 transition count 197
Iterating global reduction 3 with 17 rules applied. Total rules applied 676 place count 117 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 14 stabilizing places and 18 stable transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 678 place count 117 transition count 195
Computed a total of 14 stabilizing places and 18 stable transitions
Performed 47 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 772 place count 70 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 774 place count 70 transition count 133
Computed a total of 7 stabilizing places and 11 stable transitions
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 810 place count 52 transition count 153
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Iterating post reduction 5 with 9 rules applied. Total rules applied 819 place count 52 transition count 144
Computed a total of 9 stabilizing places and 16 stable transitions
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 830 place count 41 transition count 100
Iterating global reduction 6 with 11 rules applied. Total rules applied 841 place count 41 transition count 100
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Iterating post reduction 6 with 8 rules applied. Total rules applied 849 place count 41 transition count 92
Computed a total of 9 stabilizing places and 16 stable transitions
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 852 place count 38 transition count 74
Iterating global reduction 7 with 3 rules applied. Total rules applied 855 place count 38 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Iterating post reduction 7 with 2 rules applied. Total rules applied 857 place count 38 transition count 72
Computed a total of 9 stabilizing places and 16 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 861 place count 36 transition count 88
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 887 place count 36 transition count 62
Computed a total of 9 stabilizing places and 12 stable transitions
Computed a total of 9 stabilizing places and 12 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 35 transition count 61
Computed a total of 8 stabilizing places and 18 stable transitions
Computed a total of 8 stabilizing places and 18 stable transitions
Applied a total of 888 rules in 147 ms. Remains 35 /477 variables (removed 442) and now considering 61/589 (removed 528) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 159 ms. Remains : 35/477 places, 61/589 transitions.
Finished random walk after 6 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=6 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 499 ms.
ITS solved all properties within timeout

BK_STOP 1717361460836

--------------------
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-13"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is CO4-PT-13, 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 r564-tall-171734907500061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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