fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r175-csrt-158987856400186
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NeoElection-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15747.630 1800000.00 10119.00 90.60 T normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r175-csrt-158987856400186.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NeoElection-PT-5, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-csrt-158987856400186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 230K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 564K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 176K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 485K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 112K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 143K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 349K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 419K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 57K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 116K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 4.1M Apr 30 13:04 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 1591178935376

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:08:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 1800, -rebuildPNML]
[2020-06-03 10:08:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:08:58] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2020-06-03 10:08:58] [INFO ] Transformed 3090 places.
[2020-06-03 10:08:58] [INFO ] Transformed 4674 transitions.
[2020-06-03 10:08:58] [INFO ] Parsed PT model containing 3090 places and 4674 transitions in 418 ms.
Deduced a syphon composed of 2866 places in 39 ms
Reduce places removed 2886 places and 4438 transitions.
Reduce places removed 11 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 153 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 4 ms.23524KB memory used
Starting structural reductions, iteration 0 : 193/193 places, 236/236 transitions.
Discarding 20 places :
Also discarding 0 output transitions
Graph (complete) has 635 edges and 193 vertex of which 173 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.13 ms
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 173 transition count 226
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 26 place count 158 transition count 226
Symmetric choice reduction at 0 with 32 rule applications. Total rules 58 place count 158 transition count 226
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 113 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 122 place count 126 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 122 place count 126 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 121 transition count 108
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 137 place count 116 transition count 103
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 142 place count 111 transition count 103
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 147 place count 106 transition count 98
Ensure Unique test removed 5 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 101 transition count 98
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 96 transition count 93
Ensure Unique test removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 162 place count 91 transition count 93
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 167 place count 86 transition count 88
Reduce places removed 5 places and 0 transitions.
Discarding 25 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Graph (complete) has 144 edges and 81 vertex of which 56 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 3 with 20 rules applied. Total rules applied 187 place count 56 transition count 53
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 201 place count 42 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 201 place count 42 transition count 52
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 203 place count 41 transition count 52
Symmetric choice reduction at 5 with 12 rule applications. Total rules 215 place count 41 transition count 52
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 18 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 239 place count 29 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 239 place count 29 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 245 place count 26 transition count 31
Applied a total of 245 rules in 135 ms. Remains 26 /193 variables (removed 167) and now considering 31/236 (removed 205) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/193 places, 31/236 transitions.
Finished Parikh directed walk after 39 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=39 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK

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

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="NeoElection-PT-5"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is NeoElection-PT-5, 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 r175-csrt-158987856400186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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