About the Execution of ITS-Tools for Philosophers-PT-000050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15756.480 | 3799.00 | 8030.00 | 110.60 | 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 776K
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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 9.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Philosophers-PT-000050, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r116-csrt-152666475900783
=====================================================================
--------------------
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-PT-000050-ReachabilityDeadlock-0
=== Now, execution of the tool begins
BK_START 1527198216350
Flatten gal took : 100 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 36 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 :Fork_26 + Catch2_26 + Catch1_27 = 1
invariant :Think_23 + Catch2_23 + Catch1_23 = 1
invariant :Fork_39 + Catch2_39 + Catch1_40 = 1
invariant :Think_48 + Catch2_48 + Catch1_48 = 1
invariant :Fork_16 + Catch2_16 + Catch1_17 = 1
invariant :Think_15 + Catch2_15 + Catch1_15 = 1
invariant :Fork_3 + Catch2_3 + Catch1_4 = 1
invariant :Fork_47 + Catch2_47 + Catch1_48 = 1
invariant :Fork_27 + Catch2_27 + Catch1_28 = 1
invariant :Fork_21 + Catch2_21 + Catch1_22 = 1
invariant :Think_5 + Catch2_5 + Catch1_5 = 1
invariant :Think_47 + Catch2_47 + Catch1_47 = 1
invariant :Think_11 + Catch2_11 + Catch1_11 = 1
invariant :Think_35 + Catch2_35 + Catch1_35 = 1
invariant :Fork_35 + Catch2_35 + Catch1_36 = 1
invariant :Fork_45 + Catch2_45 + Catch1_46 = 1
invariant :Think_1 + Catch2_1 + Catch1_1 = 1
invariant :Think_6 + Catch2_6 + Catch1_6 = 1
invariant :Think_22 + Catch2_22 + Catch1_22 = 1
invariant :Think_30 + Catch2_30 + Catch1_30 = 1
invariant :Think_34 + Catch2_34 + Catch1_34 = 1
invariant :Fork_5 + Catch2_5 + Catch1_6 = 1
invariant :Fork_22 + Catch2_22 + Catch1_23 = 1
invariant :Think_31 + Catch2_31 + Catch1_31 = 1
invariant :Fork_15 + Catch2_15 + Catch1_16 = 1
invariant :Think_46 + Catch2_46 + Catch1_46 = 1
invariant :Think_14 + Catch2_14 + Catch1_14 = 1
invariant :Think_16 + Catch2_16 + Catch1_16 = 1
invariant :Think_24 + Catch2_24 + Catch1_24 = 1
invariant :Think_45 + Catch2_45 + Catch1_45 = 1
invariant :Fork_46 + Catch2_46 + Catch1_47 = 1
invariant :Think_29 + Catch2_29 + Catch1_29 = 1
invariant :Think_10 + Catch2_10 + Catch1_10 = 1
invariant :Think_43 + Catch2_43 + Catch1_43 = 1
invariant :Fork_32 + Catch2_32 + Catch1_33 = 1
invariant :Think_42 + Catch2_42 + Catch1_42 = 1
invariant :Think_26 + Catch2_26 + Catch1_26 = 1
invariant :Fork_1 + Catch2_1 + Catch1_2 = 1
invariant :Fork_28 + Catch2_28 + Catch1_29 = 1
invariant :Fork_7 + Catch2_7 + Catch1_8 = 1
invariant :Fork_38 + Catch2_38 + Catch1_39 = 1
invariant :Fork_11 + Catch2_11 + Catch1_12 = 1
invariant :Think_2 + Catch2_2 + Catch1_2 = 1
invariant :Think_9 + Catch2_9 + Catch1_9 = 1
invariant :Think_3 + Catch2_3 + Catch1_3 = 1
invariant :Fork_24 + Catch2_24 + Catch1_25 = 1
invariant :Think_21 + Catch2_21 + Catch1_21 = 1
invariant :Fork_41 + Catch2_41 + Catch1_42 = 1
invariant :Fork_43 + Catch2_43 + Catch1_44 = 1
invariant :Fork_50 + Catch1_1 + Catch2_50 = 1
invariant :Think_4 + Catch2_4 + Catch1_4 = 1
invariant :Fork_19 + Catch2_19 + Catch1_20 = 1
invariant :Think_33 + Catch2_33 + Catch1_33 = 1
invariant :Fork_10 + Catch2_10 + Catch1_11 = 1
invariant :Think_27 + Catch2_27 + Catch1_27 = 1
invariant :Fork_4 + Catch2_4 + Catch1_5 = 1
invariant :Fork_29 + Catch2_29 + Catch1_30 = 1
invariant :Think_20 + Catch2_20 + Catch1_20 = 1
invariant :Think_8 + Catch2_8 + Catch1_8 = 1
invariant :Fork_30 + Catch2_30 + Catch1_31 = 1
invariant :Fork_49 + Catch2_49 + Catch1_50 = 1
invariant :Fork_33 + Catch2_33 + Catch1_34 = 1
invariant :Fork_42 + Catch2_42 + Catch1_43 = 1
invariant :Think_50 + Catch2_50 + Catch1_50 = 1
invariant :Think_41 + Catch2_41 + Catch1_41 = 1
invariant :Think_25 + Catch2_25 + Catch1_25 = 1
invariant :Fork_13 + Catch2_13 + Catch1_14 = 1
invariant :Fork_25 + Catch2_25 + Catch1_26 = 1
invariant :Fork_23 + Catch2_23 + Catch1_24 = 1
invariant :Fork_40 + Catch2_40 + Catch1_41 = 1
invariant :Fork_8 + Catch2_8 + Catch1_9 = 1
invariant :Think_32 + Catch2_32 + Catch1_32 = 1
invariant :Fork_20 + Catch2_20 + Catch1_21 = 1
invariant :Fork_31 + Catch2_31 + Catch1_32 = 1
invariant :Fork_36 + Catch2_36 + Catch1_37 = 1
invariant :Fork_9 + Catch2_9 + Catch1_10 = 1
invariant :Fork_34 + Catch2_34 + Catch1_35 = 1
invariant :Think_44 + Catch2_44 + Catch1_44 = 1
invariant :Fork_37 + Catch2_37 + Catch1_38 = 1
invariant :Think_17 + Catch2_17 + Catch1_17 = 1
invariant :Think_39 + Catch2_39 + Catch1_39 = 1
invariant :Fork_44 + Catch2_44 + Catch1_45 = 1
invariant :Think_13 + Catch2_13 + Catch1_13 = 1
invariant :Think_18 + Catch2_18 + Catch1_18 = 1
invariant :Fork_18 + Catch2_18 + Catch1_19 = 1
invariant :Think_38 + Catch2_38 + Catch1_38 = 1
invariant :Think_37 + Catch2_37 + Catch1_37 = 1
invariant :Fork_48 + Catch2_48 + Catch1_49 = 1
invariant :Think_19 + Catch2_19 + Catch1_19 = 1
invariant :Think_40 + Catch2_40 + Catch1_40 = 1
invariant :Think_7 + Catch2_7 + Catch1_7 = 1
invariant :Think_12 + Catch2_12 + Catch1_12 = 1
invariant :Fork_14 + Catch2_14 + Catch1_15 = 1
invariant :Think_49 + Catch2_49 + Catch1_49 = 1
invariant :Think_28 + Catch2_28 + Catch1_28 = 1
invariant :Fork_2 + Catch2_2 + Catch1_3 = 1
invariant :Fork_17 + Catch2_17 + Catch1_18 = 1
invariant :Fork_6 + Catch2_6 + Catch1_7 = 1
invariant :Think_36 + Catch2_36 + Catch1_36 = 1
invariant :Fork_12 + Catch2_12 + Catch1_13 = 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.054917,5944,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.287512,16184,2,400,7,82792,9,1,4586,6221,2
System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA Philosophers-PT-000050-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
[ Catch1_50=1 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_1=1 Catch1_15=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 ]
[ Catch2_50=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_1=1 Catch2_7=1 Catch2_6=1 Catch2_5=1 Catch2_4=1 Catch2_3=1 Catch2_2=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 1527198220149
--------------------
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 9:43:38 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 9:43:38 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 24, 2018 9:43:38 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 110 ms
May 24, 2018 9:43:38 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
May 24, 2018 9:43:39 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
May 24, 2018 9:43:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 24 ms
May 24, 2018 9:43:39 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 95 ms
May 24, 2018 9:43:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 5 ms
May 24, 2018 9:43:39 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
May 24, 2018 9:43:39 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 3 ms
May 24, 2018 9:43:39 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 200 transitions.
May 24, 2018 9:43:39 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 30 ms
May 24, 2018 9:43:39 PM fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver checkSat
WARNING: SMT solver unexpectedly returned 'unknown' answer, retrying.
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:318)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:305)
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 9:43:39 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 360ms 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-PT-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-PT-000050.tgz
mv Philosophers-PT-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-PT-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-152666475900783"
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 '
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 ;