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-158987856400166.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-COL-8, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-csrt-158987856400166
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 3.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3.9K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 120K 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 1591178919583

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:08:42] [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:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:08:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:08:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 818 ms
[2020-06-03 10:08:42] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,

[2020-06-03 10:08:42] [INFO ] Detected 4 constant HL places corresponding to 675 PT places.
[2020-06-03 10:08:42] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 10062 PT places and 34578.0 transition bindings in 43 ms.
[2020-06-03 10:08:42] [INFO ] Computed order based on color domains.
[2020-06-03 10:08:43] [INFO ] Unfolded HLPN to a Petri net with 10062 places and 21244 transitions in 240 ms.
[2020-06-03 10:08:43] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 9487 places in 58 ms
Reduce places removed 9543 places and 20351 transitions.
Reduce places removed 17 places and 0 transitions.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 407 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 6 ms.29997KB memory used
Starting structural reductions, iteration 0 : 502/502 places, 893/893 transitions.
Discarding 56 places :
Also discarding 0 output transitions
Graph (complete) has 1916 edges and 502 vertex of which 446 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.13 ms
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 1 place count 446 transition count 877
Deduced a syphon composed of 16 places in 2 ms
Ensure Unique test removed 8 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 41 place count 422 transition count 877
Symmetric choice reduction at 0 with 98 rule applications. Total rules 139 place count 422 transition count 877
Deduced a syphon composed of 98 places in 2 ms
Reduce places removed 98 places and 575 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 335 place count 324 transition count 302
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 335 place count 324 transition count 294
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 351 place count 316 transition count 294
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 359 place count 308 transition count 286
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 367 place count 300 transition count 286
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 375 place count 292 transition count 278
Ensure Unique test removed 8 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 383 place count 284 transition count 278
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 391 place count 276 transition count 270
Ensure Unique test removed 8 places
Iterating post reduction 2 with 8 rules applied. Total rules applied 399 place count 268 transition count 270
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 407 place count 260 transition count 262
Ensure Unique test removed 8 places
Iterating post reduction 3 with 8 rules applied. Total rules applied 415 place count 252 transition count 262
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 423 place count 244 transition count 254
Ensure Unique test removed 8 places
Iterating post reduction 4 with 8 rules applied. Total rules applied 431 place count 236 transition count 254
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 439 place count 228 transition count 246
Ensure Unique test removed 8 places
Iterating post reduction 5 with 8 rules applied. Total rules applied 447 place count 220 transition count 246
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 455 place count 212 transition count 238
Reduce places removed 8 places and 0 transitions.
Discarding 64 places :
Also discarding 57 output transitions
Drop transitions removed 57 transitions
Graph (complete) has 399 edges and 204 vertex of which 140 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 6 with 44 rules applied. Total rules applied 499 place count 140 transition count 146
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 534 place count 105 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 534 place count 105 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 536 place count 104 transition count 145
Symmetric choice reduction at 8 with 42 rule applications. Total rules 578 place count 104 transition count 145
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 63 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 662 place count 62 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 662 place count 62 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 674 place count 56 transition count 76
Applied a total of 674 rules in 262 ms. Remains 56 /502 variables (removed 446) and now considering 76/893 (removed 817) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/502 places, 76/893 transitions.
Finished Parikh directed walk after 112 steps, including 0 resets, run found a deadlock after 3 ms. (steps per millisecond=37 )
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-COL-8"
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-COL-8, 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-158987856400166"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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