fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r117-csrt-152666477600881
Last Updated
June 26, 2018

About the Execution of ITS-Tools.L for PhilosophersDyn-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15757.480 29305.00 69619.00 123.80 T normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.....................................................
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 151K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 585K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 132K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 873K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is PhilosophersDyn-PT-10, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-152666477600881
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-10-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527279882149

Flatten gal took : 756 ms
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 170 transition count 2265
Applied a total of 45 rules in 73 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2310 (removed 45) transitions.
Normalized transition count is 1905
// Phase 1: matrix 1905 rows 170 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph46841818553335562.txt, -o, /tmp/graph46841818553335562.bin, -w, /tmp/graph46841818553335562.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph46841818553335562.bin, -l, -1, -v, -w, /tmp/graph46841818553335562.weights, -q, 0, -e, 0.001], workingDir=null]
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 167 ordering constraints for composite.
built 543 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,199051,12.4898,269904,7879,3217,193349,13924,6288,107930,1703,100979,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,14025,20.701,314960,7590,1304,425952,157398,19130,388668,7151,636546,2669680

System contains 14025 deadlocks (shown below if less than --print-limit option) !
FORMULA PhilosophersDyn-PT-10-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 14025 states ] showing 10 first states
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_3=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ WaitRight_3=1 Neighbourhood_3_1=1 WaitLeft_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_8=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ WaitLeft_8=1 WaitRight_8=1 Neighbourhood_8_1=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_1=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_7=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ Outside_5=1 ]
} u5={[ WaitLeft_7=1 WaitRight_7=1 Neighbourhood_7_1=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_5=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ WaitLeft_5=1 WaitRight_5=1 Neighbourhood_5_1=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_6=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ WaitLeft_6=1 WaitRight_6=1 Neighbourhood_6_1=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Neighbourhood_2_4=1 HasRight_2=1 WaitLeft_2=1 ]
} u8={[ Outside_6=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ WaitLeft_4=1 ]
} u3={[ WaitRight_4=1 Neighbourhood_4_1=1 ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_2=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Outside_2=1 ]
} u8={[ WaitLeft_6=1 WaitRight_6=1 Neighbourhood_6_9=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ WaitRight_9=1 HasLeft_9=1 Neighbourhood_9_1=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_6=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Outside_2=1 ]
} u8={[ WaitLeft_6=1 HasRight_6=1 Neighbourhood_6_7=1 ]
} u6={[ Outside_5=1 ]
} u5={[ WaitLeft_7=1 WaitRight_7=1 Neighbourhood_7_1=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ Outside_8=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_6=1 ]
} ]
[ u10={[ Neighbourhood_1_10=1 HasRight_1=1 WaitLeft_1=1 ]
} u9={[ Outside_2=1 ]
} u8={[ WaitLeft_6=1 WaitRight_6=1 Neighbourhood_6_8=1 ]
} u6={[ Outside_5=1 ]
} u5={[ Outside_7=1 ]
} u4={[ Outside_3=1 ]
} i3={[ u7={[ Outside_4=1 ]
} u3={[ ]
} ]
} u2={[ WaitRight_8=1 HasLeft_8=1 Neighbourhood_8_1=1 ]
} u1={[ Outside_9=1 ]
} u0={[ WaitLeft_10=1 WaitRight_10=1 Neighbourhood_10_6=1 ]
} ]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527279911454

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 25, 2018 8:24:44 PM fr.lip6.move.gal.application.Application start
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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 25, 2018 8:24:44 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2018 8:24:44 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 280 ms
May 25, 2018 8:24:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 170 places.
May 25, 2018 8:24:45 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 2310 transitions.
May 25, 2018 8:24:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 751 ms
May 25, 2018 8:24:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 70 ms
May 25, 2018 8:24:46 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 2310 transitions.
May 25, 2018 8:24:46 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 25, 2018 8:24:47 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 2265 transitions.
May 25, 2018 8:24:47 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Too many transitions (2265) to apply POR reductions. Disabling POR matrices.
May 25, 2018 8:24:47 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 395 ms
May 25, 2018 8:24:47 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 497ms conformant to PINS in folder :/home/mcc/execution
May 25, 2018 8:24:47 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 359 ms
Begin: Fri May 25 20:24:48 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri May 25 20:24:48 2018
network size: 170 nodes, 8940 links, 4530 weight
quality increased from -0.0115536 to 0.391828
end computation: Fri May 25 20:24:48 2018
level 1:
start computation: Fri May 25 20:24:48 2018
network size: 11 nodes, 121 links, 4530 weight
quality increased from 0.391828 to 0.403091
end computation: Fri May 25 20:24:48 2018
level 2:
start computation: Fri May 25 20:24:48 2018
network size: 10 nodes, 100 links, 4530 weight
quality increased from 0.403091 to 0.403091
end computation: Fri May 25 20:24:48 2018
End: Fri May 25 20:24:48 2018
Total duration: 0 sec
0.403091
May 25, 2018 8:24:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2018 8:24:48 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 336 ms
May 25, 2018 8:24:48 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 25, 2018 8:24:50 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 3327 redundant transitions.
May 25, 2018 8:24:50 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 18 ms

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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstoolsl"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstoolsl"
echo " Input is PhilosophersDyn-PT-10, 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-csrt-152666477600881"
echo "====================================================================="
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
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 ;