fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r117-tall-167814495800466
Last Updated
May 14, 2023

About the Execution of LoLa+red for DLCround-PT-11a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
197.228 3960.00 5819.00 565.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/mcc2023-input.r117-tall-167814495800466.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DLCround-PT-11a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-tall-167814495800466
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 19:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 762K Mar 5 18:22 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 1679417309813

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DLCround-PT-11a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 16:48:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-21 16:48:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:48:31] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-21 16:48:31] [INFO ] Transformed 377 places.
[2023-03-21 16:48:31] [INFO ] Transformed 2993 transitions.
[2023-03-21 16:48:31] [INFO ] Found NUPN structural information;
[2023-03-21 16:48:31] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 221 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
Built sparse matrix representations for Structural reductions in 6 ms.19378KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Graph (trivial) has 216 edges and 377 vertex of which 56 / 377 are part of one of the 16 SCC in 4 ms
Free SCC test removed 40 places
Ensure Unique test removed 476 transitions
Reduce isomorphic transitions removed 476 transitions.
Computed a total of 229 stabilizing places and 1 stable transitions
Computed a total of 229 stabilizing places and 1 stable transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 337 transition count 2233
Reduce places removed 4 places and 0 transitions.
Computed a total of 229 stabilizing places and 1 stable transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 333 transition count 2233
Computed a total of 229 stabilizing places and 1 stable transitions
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 37 place count 305 transition count 1773
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 305 transition count 1773
Ensure Unique test removed 184 transitions
Reduce isomorphic transitions removed 184 transitions.
Computed a total of 229 stabilizing places and 1 stable transitions
Iterating post reduction 2 with 184 rules applied. Total rules applied 249 place count 305 transition count 1589
Computed a total of 229 stabilizing places and 1 stable transitions
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 289 place count 285 transition count 1569
Ensure Unique test removed 228 transitions
Reduce isomorphic transitions removed 228 transitions.
Computed a total of 229 stabilizing places and 1 stable transitions
Iterating post reduction 3 with 228 rules applied. Total rules applied 517 place count 285 transition count 1341
Computed a total of 229 stabilizing places and 1 stable transitions
Computed a total of 229 stabilizing places and 1 stable transitions
Drop transitions removed 636 transitions
Redundant transition composition rules discarded 636 transitions
Iterating global reduction 4 with 636 rules applied. Total rules applied 1153 place count 285 transition count 705
Computed a total of 229 stabilizing places and 1 stable transitions
Discarding 164 places :
Symmetric choice reduction at 4 with 164 rule applications. Total rules 1317 place count 121 transition count 301
Iterating global reduction 4 with 164 rules applied. Total rules applied 1481 place count 121 transition count 301
Computed a total of 65 stabilizing places and 1 stable transitions
Computed a total of 65 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1482 place count 120 transition count 300
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 188 transitions
Reduce isomorphic transitions removed 188 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (trivial) has 112 edges and 56 vertex of which 56 / 56 are part of one of the 16 SCC in 0 ms
Free SCC test removed 40 places
Iterating post reduction 4 with 253 rules applied. Total rules applied 1735 place count 16 transition count 112
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Found a source transition so no deadlocks exist. place count 0 transition count 1
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION
Total runtime 531 ms.
ITS solved all properties within timeout

BK_STOP 1679417313773

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DLCround-PT-11a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DLCround-PT-11a, 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 r117-tall-167814495800466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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