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 176K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 12K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-COL-000050, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r116-csrt-152666475700692
=====================================================================

--------------------
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 Philosophers-COL-000050-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527193841784

20:30:44.275 [main] ERROR PNML validation - The rng grammar file can't be accessed : www.pnml.org
20:30:44.277 [main] ERROR import - Grammar file errors have been raised, the validation can't be done, process will continue without Grammar validation
Flatten gal took : 204 ms
Performed 50 Post agglomeration using F-continuation condition.
Constant places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 200 transition count 200
Applied a total of 50 rules in 43 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
// Phase 1: matrix 200 rows 200 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 200 rows 200 cols
invariant :think_7 + catch1_7 + catch2_7 = 1
invariant :think_4 + catch1_4 + catch2_4 = 1
invariant :think_21 + catch1_21 + catch2_21 = 1
invariant :think_49 + catch1_49 + catch2_49 = 1
invariant :fork_3 + catch1_4 + catch2_3 = 1
invariant :think_24 + catch1_24 + catch2_24 = 1
invariant :think_30 + catch1_30 + catch2_30 = 1
invariant :fork_49 + catch1_0 + catch2_49 = 1
invariant :think_1 + catch1_1 + catch2_1 = 1
invariant :fork_7 + catch1_8 + catch2_7 = 1
invariant :fork_17 + catch1_18 + catch2_17 = 1
invariant :fork_19 + catch1_20 + catch2_19 = 1
invariant :think_46 + catch1_46 + catch2_46 = 1
invariant :think_42 + catch1_42 + catch2_42 = 1
invariant :think_17 + catch1_17 + catch2_17 = 1
invariant :fork_45 + catch1_46 + catch2_45 = 1
invariant :fork_1 + catch1_2 + catch2_1 = 1
invariant :think_8 + catch1_8 + catch2_8 = 1
invariant :fork_14 + catch1_15 + catch2_14 = 1
invariant :fork_41 + catch1_42 + catch2_41 = 1
invariant :think_41 + catch1_41 + catch2_41 = 1
invariant :fork_46 + catch1_47 + catch2_46 = 1
invariant :fork_33 + catch1_34 + catch2_33 = 1
invariant :fork_43 + catch1_44 + catch2_43 = 1
invariant :think_31 + catch1_31 + catch2_31 = 1
invariant :fork_42 + catch1_43 + catch2_42 = 1
invariant :fork_16 + catch1_17 + catch2_16 = 1
invariant :fork_32 + catch1_33 + catch2_32 = 1
invariant :fork_21 + catch1_22 + catch2_21 = 1
invariant :fork_39 + catch1_40 + catch2_39 = 1
invariant :fork_22 + catch1_23 + catch2_22 = 1
invariant :fork_38 + catch1_39 + catch2_38 = 1
invariant :fork_8 + catch1_9 + catch2_8 = 1
invariant :fork_20 + catch1_21 + catch2_20 = 1
invariant :fork_25 + catch1_26 + catch2_25 = 1
invariant :think_2 + catch1_2 + catch2_2 = 1
invariant :fork_40 + catch1_41 + catch2_40 = 1
invariant :think_38 + catch1_38 + catch2_38 = 1
invariant :think_44 + catch1_44 + catch2_44 = 1
invariant :fork_31 + catch1_32 + catch2_31 = 1
invariant :think_35 + catch1_35 + catch2_35 = 1
invariant :fork_27 + catch1_28 + catch2_27 = 1
invariant :think_40 + catch1_40 + catch2_40 = 1
invariant :think_23 + catch1_23 + catch2_23 = 1
invariant :fork_5 + catch1_6 + catch2_5 = 1
invariant :fork_36 + catch1_37 + catch2_36 = 1
invariant :fork_29 + catch1_30 + catch2_29 = 1
invariant :fork_30 + catch1_31 + catch2_30 = 1
invariant :fork_34 + catch1_35 + catch2_34 = 1
invariant :think_45 + catch1_45 + catch2_45 = 1
invariant :fork_15 + catch1_16 + catch2_15 = 1
invariant :think_22 + catch1_22 + catch2_22 = 1
invariant :fork_11 + catch1_12 + catch2_11 = 1
invariant :fork_12 + catch1_13 + catch2_12 = 1
invariant :think_18 + catch1_18 + catch2_18 = 1
invariant :think_27 + catch1_27 + catch2_27 = 1
invariant :fork_24 + catch1_25 + catch2_24 = 1
invariant :think_26 + catch1_26 + catch2_26 = 1
invariant :think_32 + catch1_32 + catch2_32 = 1
invariant :fork_13 + catch1_14 + catch2_13 = 1
invariant :think_15 + catch1_15 + catch2_15 = 1
invariant :fork_4 + catch1_5 + catch2_4 = 1
invariant :think_0 + catch1_0 + catch2_0 = 1
invariant :fork_23 + catch1_24 + catch2_23 = 1
invariant :fork_37 + catch1_38 + catch2_37 = 1
invariant :fork_2 + catch1_3 + catch2_2 = 1
invariant :fork_0 + catch1_1 + catch2_0 = 1
invariant :think_28 + catch1_28 + catch2_28 = 1
invariant :think_16 + catch1_16 + catch2_16 = 1
invariant :think_5 + catch1_5 + catch2_5 = 1
invariant :fork_48 + catch1_49 + catch2_48 = 1
invariant :fork_6 + catch1_7 + catch2_6 = 1
invariant :think_6 + catch1_6 + catch2_6 = 1
invariant :think_14 + catch1_14 + catch2_14 = 1
invariant :think_25 + catch1_25 + catch2_25 = 1
invariant :think_37 + catch1_37 + catch2_37 = 1
invariant :think_39 + catch1_39 + catch2_39 = 1
invariant :think_20 + catch1_20 + catch2_20 = 1
invariant :fork_44 + catch1_45 + catch2_44 = 1
invariant :think_10 + catch1_10 + catch2_10 = 1
invariant :think_11 + catch1_11 + catch2_11 = 1
invariant :think_33 + catch1_33 + catch2_33 = 1
invariant :think_19 + catch1_19 + catch2_19 = 1
invariant :think_34 + catch1_34 + catch2_34 = 1
invariant :think_43 + catch1_43 + catch2_43 = 1
invariant :fork_18 + catch1_19 + catch2_18 = 1
invariant :think_3 + catch1_3 + catch2_3 = 1
invariant :fork_26 + catch1_27 + catch2_26 = 1
invariant :fork_9 + catch1_10 + catch2_9 = 1
invariant :think_12 + catch1_12 + catch2_12 = 1
invariant :think_9 + catch1_9 + catch2_9 = 1
invariant :think_36 + catch1_36 + catch2_36 = 1
invariant :think_47 + catch1_47 + catch2_47 = 1
invariant :fork_28 + catch1_29 + catch2_28 = 1
invariant :fork_35 + catch1_36 + catch2_35 = 1
invariant :think_13 + catch1_13 + catch2_13 = 1
invariant :think_48 + catch1_48 + catch2_48 = 1
invariant :think_29 + catch1_29 + catch2_29 = 1
invariant :fork_47 + catch1_48 + catch2_47 = 1
invariant :fork_10 + catch1_11 + catch2_10 = 1
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,7.92071e+20,0.068704,5808,2,790,5,3456,6,0,1003,2433,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,2,0.349425,16012,2,400,7,82792,9,1,4605,6221,2

System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA Philosophers-COL-000050-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ catch1_49=1 catch1_48=1 catch1_47=1 catch1_46=1 catch1_45=1 catch1_44=1 catch1_43=1 catch1_42=1 catch1_41=1 catch1_40=1 catch1_39=1 catch1_38=1 catch1_37=1 catch1_36=1 catch1_35=1 catch1_34=1 catch1_33=1 catch1_32=1 catch1_31=1 catch1_30=1 catch1_29=1 catch1_28=1 catch1_27=1 catch1_26=1 catch1_25=1 catch1_24=1 catch1_23=1 catch1_22=1 catch1_21=1 catch1_20=1 catch1_19=1 catch1_18=1 catch1_17=1 catch1_16=1 catch1_15=1 catch1_0=1 catch1_14=1 catch1_13=1 catch1_12=1 catch1_11=1 catch1_10=1 catch1_9=1 catch1_8=1 catch1_7=1 catch1_6=1 catch1_5=1 catch1_4=1 catch1_3=1 catch1_2=1 catch1_1=1 ]
[ catch2_49=1 catch2_48=1 catch2_47=1 catch2_46=1 catch2_45=1 catch2_44=1 catch2_43=1 catch2_42=1 catch2_41=1 catch2_40=1 catch2_39=1 catch2_38=1 catch2_37=1 catch2_36=1 catch2_35=1 catch2_34=1 catch2_33=1 catch2_32=1 catch2_31=1 catch2_30=1 catch2_29=1 catch2_28=1 catch2_27=1 catch2_26=1 catch2_25=1 catch2_24=1 catch2_23=1 catch2_22=1 catch2_21=1 catch2_20=1 catch2_19=1 catch2_18=1 catch2_17=1 catch2_16=1 catch2_15=1 catch2_14=1 catch2_13=1 catch2_12=1 catch2_11=1 catch2_10=1 catch2_9=1 catch2_8=1 catch2_7=1 catch2_0=1 catch2_6=1 catch2_5=1 catch2_4=1 catch2_3=1 catch2_2=1 catch2_1=1 ]
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 1527193847114

--------------------
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/ -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/ -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 24, 2018 8:30:43 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/, -smt]
May 24, 2018 8:30:43 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 24, 2018 8:30:43 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Load time of PNML (colored model parsed with PNMLFW) : 905 ms
May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 places.
May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Computed order using colors.
May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: sort/places :Philo->think,fork,catch1,catch2,eat,

May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.HLGALTransformer handlePage
INFO: Transformed 5 transitions.
May 24, 2018 8:30:44 PM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Computed order based on color domains.
May 24, 2018 8:30:44 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 9 ms
May 24, 2018 8:30:45 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 153 ms
May 24, 2018 8:30:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 10 ms
May 24, 2018 8:30:45 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
May 24, 2018 8:30:46 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 4 ms
May 24, 2018 8:30:46 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 200 transitions.
May 24, 2018 8:30:46 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 20 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)
May 24, 2018 8:30:46 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 562ms 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="Philosophers-COL-000050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 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 itstools"
echo " Input is Philosophers-COL-000050, 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 r116-csrt-152666475700692"
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 ;