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 208K
-rw-r--r-- 1 mcc users 3.6K May 30 21:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 21:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 28 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.7K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 27 03:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 33K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is DoubleExponent-PT-002, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-csrt-152749175900197
=====================================================================

--------------------
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 DoubleExponent-PT-002-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527986772924

Flatten gal took : 122 ms
Constant places removed 5 places and 1 transitions.
Performed 41 Post agglomeration using F-continuation condition.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 105 transition count 56
Constant places removed 42 places and 1 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 88 place count 63 transition count 55
Performed 2 Pre agglomeration using Quasi-Persistent + HF-interchangeable + Divergent Free condition.
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 63 transition count 53
Constant places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 61 transition count 53
Performed 6 Post agglomeration using F-continuation condition.
Constant places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 96 place count 55 transition count 47
Performed 2 Post agglomeration using F-continuation condition.
Constant places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 98 place count 53 transition count 47
Applied a total of 98 rules in 31 ms. Remains 53 /110 variables (removed 57) and now considering 47/98 (removed 51) transitions.
// Phase 1: matrix 47 rows 53 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/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/graph4086543806123599912.txt, -o, /tmp/graph4086543806123599912.bin, -w, /tmp/graph4086543806123599912.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/graph4086543806123599912.bin, -l, -1, -v, -w, /tmp/graph4086543806123599912.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 47 rows 53 cols
invariant :p69 + -1'p75 + -1'p77 + -1'p78 + -1'p81 + -1'p83 + -1'p84 = 0
invariant :-1'p55 + p57 + -1'p58 + p60 + -1'p81 + -1'p93 = 0
invariant :p8 + p9 = 2
invariant :-1'p104 + p12 + p13 + -1'p22 + p28 + p30 + p31 + p36 + p37 + -1'p46 = 2
invariant :-1'p55 + p56 + -1'p58 + p59 = 0
invariant :-1'p104 + -1'p22 + p28 + p30 + p31 + p34 + p36 + p37 = 0
invariant :p10 + p11 = 2
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 17 ordering constraints for composite.
built 16 ordering constraints for composite.
built 13 ordering constraints for composite.
built 20 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 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,1764,0.085615,7792,454,257,5696,1365,214,10741,54,7206,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,396,0.106405,7792,268,129,5696,2159,548,10741,249,7471,5546

System contains 396 deadlocks (shown below if less than --print-limit option) !
FORMULA DoubleExponent-PT-002-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 396 states ] showing 10 first states
[ i3={[ u12={[ ]
} u11={[ p56=2 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ ]
} u14={[ p55=2 ]
} ]
} i0={[ u5={[ ]
} u1={[ p57=2 ]
} u0={[ p10=2 ]
} ]
} i2={[ u15={[ p8=2 ]
} u8={[ ]
} u4={[ ]
} u3={[ p24=1 ]
} ]
} i1={[ u10={[ p48=1 ]
} u7={[ ]
} u9={[ ]
} u2={[ p13=2 p52=1 ]
} u6={[ ]
} ]
[ u10={[ ]
} u7={[ ]
} u9={[ p43=1 ]
} u2={[ p13=1 p12=1 ]
} u6={[ ]
} ]
} ]
[ i3={[ u12={[ ]
} u11={[ p56=2 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ ]
} u14={[ p55=2 ]
} ]
} i0={[ u5={[ ]
} u1={[ p57=2 ]
} u0={[ p10=2 ]
} ]
} i2={[ u15={[ p9=1 p8=1 ]
} u8={[ ]
} u4={[ p22=1 ]
} u3={[ ]
} ]
} i1={[ u10={[ ]
} u7={[ ]
} u9={[ ]
} u2={[ p12=2 ]
} u6={[ p31=1 ]
} ]
} ]
[ i3={[ u12={[ ]
} u11={[ p56=2 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ ]
} u14={[ p55=2 ]
} ]
} i0={[ u5={[ ]
} u1={[ p57=2 ]
} u0={[ p11=1 p10=1 ]
} ]
} i2={[ u15={[ p9=1 p8=1 ]
} u8={[ ]
} u4={[ p22=1 ]
} u3={[ ]
} ]
} i1={[ u10={[ ]
} u7={[ p36=1 ]
} u9={[ ]
} u2={[ p13=2 p52=1 ]
} u6={[ ]
} ]
} ]
[ i3={[ u12={[ ]
} u11={[ p56=2 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ ]
} u14={[ p55=2 ]
} ]
} i0={[ u5={[ p28=1 ]
} u1={[ p57=2 ]
} u0={[ p11=2 ]
} ]
} i2={[ u15={[ p9=1 p8=1 ]
} u8={[ ]
} u4={[ p22=1 ]
} u3={[ ]
} ]
} i1={[ u10={[ ]
} u7={[ ]
} u9={[ ]
} u2={[ p13=2 ]
} u6={[ ]
} ]
} ]
[ i3={[ u12={[ ]
} u11={[ p56=3 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ ]
} u14={[ p55=3 ]
} ]
} i0={[ u5={[ ]
} u1={[ p57=3 ]
} u0={[ p10=2 ]
} ]
} i2={[ u15={[ p9=2 ]
} u8={[ ]
} u4={[ p22=1 ]
} u3={[ ]
} ]
} i1={[ u10={[ ]
} u7={[ ]
} u9={[ ]
} u2={[ p13=1 p12=1 ]
} u6={[ p31=1 ]
} ]
[ u10={[ ]
} u7={[ p36=1 ]
} u9={[ ]
} u2={[ p13=2 p52=1 ]
} u6={[ ]
} ]
} ]
[ i3={[ u12={[ ]
} u11={[ p69=1 p56=1 p59=3 ]
} ]
} i4={[ u17={[ ]
} u16={[ ]
} u13={[ p83=1 ]
} u14={[ p58=4 ]
[ p55=1 p58=3 ]
[ p55=2 p58=2 ]
} ]
} i0={[ u5={[ ]
} u1={[ p104=1 p57=4 ]
} u0={[ p10=2 ]
} ]
} i2={[ u15={[ p9=1 p8=1 ]
} u8={[ ]
} u4={[ ]
} u3={[ ]
} ]
} i1={[ u10={[ ]
} u7={[ ]
} u9={[ ]
} u2={[ p13=1 p12=1 ]
} u6={[ p31=1 ]
} ]
[ u10={[ ]
} u7={[ p36=1 ]
} u9={[ ]
} u2={[ p13=2 p52=1 ]
} u6={[ ]
} ]
} ]
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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527986776459

--------------------
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
Jun 03, 2018 12:46:14 AM 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]
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 41 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 110 places.
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 98 transitions.
Jun 03, 2018 12:46:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 115 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 10 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 98 transitions.
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 19 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 20 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 47 transitions.
Begin: Sun Jun 3 00:46:15 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Sun Jun 3 00:46:15 2018
network size: 53 nodes, 264 links, 92 weight
quality increased from -0.0208399 to 0.390766
end computation: Sun Jun 3 00:46:15 2018
level 1:
start computation: Sun Jun 3 00:46:15 2018
network size: 18 nodes, 130 links, 92 weight
quality increased from 0.390766 to 0.511119
end computation: Sun Jun 3 00:46:15 2018
level 2:
start computation: Sun Jun 3 00:46:15 2018
network size: 5 nodes, 23 links, 92 weight
quality increased from 0.511119 to 0.511119
end computation: Sun Jun 3 00:46:15 2018
End: Sun Jun 3 00:46:15 2018
Total duration: 0 sec
0.511119
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 7 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 26 ms
Jun 03, 2018 12:46:15 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 03, 2018 12:46:16 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 30 redundant transitions.
Jun 03, 2018 12:46:16 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 2 ms
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:297)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 03, 2018 12:46:16 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 480ms conformant to PINS in folder :/home/mcc/execution

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="DoubleExponent-PT-002"
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/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 DoubleExponent-PT-002, 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 r285-csrt-152749175900197"
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 ;