Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406800363.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IOTPpurchase-PT-C03M03P03D03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 20K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rwxr-xr-x 1 mcc users 60K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620838188103

Running Version 0
[2021-05-12 16:49:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 16:49:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:49:54] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-12 16:49:54] [INFO ] Transformed 111 places.
[2021-05-12 16:49:54] [INFO ] Transformed 45 transitions.
[2021-05-12 16:49:54] [INFO ] Parsed PT model containing 111 places and 45 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:54] [INFO ] Computed 67 place invariants in 19 ms
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 15) seen :31
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :20
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :15
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :14
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :14
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 45 rows 111 cols
[2021-05-12 16:49:54] [INFO ] Computed 67 place invariants in 3 ms
[2021-05-12 16:49:54] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-12 16:49:54] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 12 ms returned sat
[2021-05-12 16:49:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:49:54] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-12 16:49:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 19 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-12 16:49:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-12 16:49:55] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 16:49:55] [INFO ] Added : 43 causal constraints over 9 iterations in 88 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 8 ms returned unsat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 3 ms returned unsat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 5 ms returned unsat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 6 ms returned unsat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 10 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:49:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 16:49:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using 8 positive and 59 generalized place invariants in 11 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:49:55] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-12 16:49:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-12 16:49:55] [INFO ] Computed and/alt/rep : 44/95/44 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-12 16:49:55] [INFO ] Added : 44 causal constraints over 9 iterations in 67 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [3, 1, 3, 1, 1, 3, 3] Max seen :[2, 1, 3, 1, 1, 3, 2]
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 15600 steps, including 99 resets, run finished after 60 ms. (steps per millisecond=260 ) properties (out of 2) seen :6 could not realise parikh vector
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA IOTPpurchase-PT-C03M03P03D03-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620838196522

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 IOTPpurchase-PT-C03M03P03D03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075406800363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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