Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699100455.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 itstools
Input is BusinessProcesses-PT-01, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100455
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.0K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 47K Mar 24 05:37 model.pnml

--------------------
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 BusinessProcesses-PT-01-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589249936192

[2020-05-12 02:18:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:18:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:18:58] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2020-05-12 02:18:58] [INFO ] Transformed 200 places.
[2020-05-12 02:18:58] [INFO ] Transformed 178 transitions.
[2020-05-12 02:18:58] [INFO ] Found NUPN structural information;
[2020-05-12 02:18:58] [INFO ] Parsed PT model containing 200 places and 178 transitions in 88 ms.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 115 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 177 rows 199 cols
[2020-05-12 02:18:58] [INFO ] Computed 30 place invariants in 8 ms
[2020-05-12 02:18:58] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned unsat
[2020-05-12 02:18:58] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-05-12 02:18:58] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-12 02:18:58] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:58] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 9 places in 171 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 59 places in 284 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 8 places in 33 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 12 places in 41 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 12 places in 34 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 17 places in 28 ms
[2020-05-12 02:18:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 737 ms
[2020-05-12 02:18:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:18:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2020-05-12 02:18:59] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:18:59] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 9 places in 53 ms
[2020-05-12 02:18:59] [INFO ] Deduced a trap composed of 48 places in 139 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 12 places in 44 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 8 places in 97 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 11 places in 59 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 51 places in 45 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 18 places in 56 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 25 places in 45 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 49 places in 44 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 49 places in 48 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 52 places in 44 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 20 places in 44 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 54 places in 37 ms
[2020-05-12 02:19:00] [INFO ] Deduced a trap composed of 32 places in 50 ms
[2020-05-12 02:19:01] [INFO ] Deduced a trap composed of 60 places in 40 ms
[2020-05-12 02:19:01] [INFO ] Deduced a trap composed of 55 places in 63 ms
[2020-05-12 02:19:01] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2020-05-12 02:19:01] [INFO ] Deduced a trap composed of 59 places in 40 ms
[2020-05-12 02:19:01] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-05-12 02:19:01] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1498 ms
[2020-05-12 02:19:01] [INFO ] Computed and/alt/rep : 176/482/176 causal constraints in 10 ms.
[2020-05-12 02:19:01] [INFO ] Added : 160 causal constraints over 33 iterations in 609 ms. Result :unsat
[2020-05-12 02:19:01] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2020-05-12 02:19:01] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-12 02:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:02] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 49 places in 73 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 46 places in 77 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 53 places in 61 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 47 places in 61 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 50 places in 43 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 40 places in 32 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 44 places in 35 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 51 places in 62 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 51 places in 39 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 53 places in 44 ms
[2020-05-12 02:19:02] [INFO ] Deduced a trap composed of 39 places in 38 ms
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 46 places in 38 ms
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 40 places in 42 ms
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 46 places in 39 ms
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 45 places in 37 ms
[2020-05-12 02:19:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 1111 ms
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using 20 positive place invariants in 16 ms returned sat
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 9 ms returned sat
[2020-05-12 02:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 12 places in 53 ms
[2020-05-12 02:19:03] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-05-12 02:19:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 205 ms
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using 20 positive place invariants in 53 ms returned sat
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-12 02:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:19:03] [INFO ] [Real]Absence check using state equation in 130 ms returned unsat
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-01-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

BK_STOP 1589249943961

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="BusinessProcesses-PT-01"
export BK_EXAMINATION="ReachabilityFireability"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-01, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699100455"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;