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.r102-smll-162075331200163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 GPPP-PT-C0001N0000000001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331200163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K 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 88K 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 3.7K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000001-UpperBounds-00
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-01
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-02
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-03
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-04
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-05
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-06
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-07
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-08
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-09
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621196435647

Running Version 0
[2021-05-16 20:20:38] [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-16 20:20:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:20:38] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-16 20:20:38] [INFO ] Transformed 33 places.
[2021-05-16 20:20:38] [INFO ] Transformed 22 transitions.
[2021-05-16 20:20:38] [INFO ] Parsed PT model containing 33 places and 22 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:20:38] [INFO ] Computed 13 place invariants in 13 ms
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :36
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :27
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :11
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:20:39] [INFO ] Computed 13 place invariants in 13 ms
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 6 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned unsat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:20:39] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-16 20:20:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-16 20:20:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 3, 1, 7, 4, 5, 1, 2, 2, 2, 5] Max seen :[3, 3, 1, 7, 4, 5, 1, 2, 2, 2, 5]
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0001N0000000001-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621196440946

--------------------
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="GPPP-PT-C0001N0000000001"
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 GPPP-PT-C0001N0000000001, 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 r102-smll-162075331200163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000001.tgz
mv GPPP-PT-C0001N0000000001 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 ;