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

About the Execution of LTSMin+red for HealthRecord-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
171.844 1611.00 2110.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.r498-tall-171640618000511.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 HealthRecord-PT-16, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r498-tall-171640618000511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 125K 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 ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717194109063

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-31 22:21:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:50] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-31 22:21:50] [INFO ] Transformed 453 places.
[2024-05-31 22:21:50] [INFO ] Transformed 594 transitions.
[2024-05-31 22:21:50] [INFO ] Found NUPN structural information;
[2024-05-31 22:21:50] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 185 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.15821KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 536 edges and 453 vertex of which 49 / 453 are part of one of the 17 SCC in 4 ms
Free SCC test removed 32 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Computed a total of 113 stabilizing places and 130 stable transitions
Computed a total of 113 stabilizing places and 130 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 219 place count 421 transition count 341
Reduce places removed 218 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 34 stabilizing places and 45 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 245 rules applied. Total rules applied 464 place count 203 transition count 314
Reduce places removed 11 places and 0 transitions.
Computed a total of 28 stabilizing places and 39 stable transitions
Iterating post reduction 2 with 11 rules applied. Total rules applied 475 place count 192 transition count 314
Computed a total of 28 stabilizing places and 39 stable transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 475 place count 192 transition count 305
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 493 place count 183 transition count 305
Computed a total of 19 stabilizing places and 30 stable transitions
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 559 place count 117 transition count 180
Iterating global reduction 3 with 66 rules applied. Total rules applied 625 place count 117 transition count 180
Computed a total of 9 stabilizing places and 10 stable transitions
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 641 place count 101 transition count 153
Iterating global reduction 3 with 16 rules applied. Total rules applied 657 place count 101 transition count 153
Computed a total of 8 stabilizing places and 8 stable transitions
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 666 place count 92 transition count 144
Iterating global reduction 3 with 9 rules applied. Total rules applied 675 place count 92 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 678 place count 92 transition count 141
Computed a total of 7 stabilizing places and 7 stable transitions
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 681 place count 89 transition count 135
Iterating global reduction 4 with 3 rules applied. Total rules applied 684 place count 89 transition count 135
Computed a total of 7 stabilizing places and 7 stable transitions
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 687 place count 86 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 690 place count 86 transition count 129
Computed a total of 7 stabilizing places and 7 stable transitions
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 693 place count 83 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 696 place count 83 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 698 place count 83 transition count 121
Computed a total of 7 stabilizing places and 7 stable transitions
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 752 place count 56 transition count 93
Computed a total of 1 stabilizing places and 1 stable transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 760 place count 52 transition count 123
Computed a total of 1 stabilizing places and 10 stable transitions
Computed a total of 1 stabilizing places and 10 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 777 place count 52 transition count 106
Computed a total of 1 stabilizing places and 4 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 778 place count 51 transition count 103
Iterating global reduction 5 with 1 rules applied. Total rules applied 779 place count 51 transition count 103
Computed a total of 1 stabilizing places and 4 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 780 place count 50 transition count 101
Iterating global reduction 5 with 1 rules applied. Total rules applied 781 place count 50 transition count 101
Computed a total of 1 stabilizing places and 4 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 783 place count 49 transition count 118
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 786 place count 49 transition count 115
Computed a total of 7 stabilizing places and 28 stable transitions
Computed a total of 7 stabilizing places and 28 stable transitions
Applied a total of 786 rules in 152 ms. Remains 49 /453 variables (removed 404) and now considering 115/594 (removed 479) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 166 ms. Remains : 49/453 places, 115/594 transitions.
Finished random walk after 10 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=5 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 434 ms.
ITS solved all properties within timeout

BK_STOP 1717194110674

--------------------
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="HealthRecord-PT-16"
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 HealthRecord-PT-16, 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 r498-tall-171640618000511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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