Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936300244.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is CSRepetitions-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936300244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 115K Apr 30 06:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 425K Apr 30 06:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 234K Apr 30 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 987K Apr 30 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 67K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 72K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 232K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 42K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 424K May 10 09:33 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 CSRepetitions-PT-07-UpperBounds-00
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-01
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-02
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-03
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-04
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-05
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-06
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-07
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-08
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-09
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-10
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-11
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-12
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-13
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-14
FORMULA_NAME CSRepetitions-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652541917715

Running Version 0
[2022-05-14 15:25:20] [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]
[2022-05-14 15:25:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 15:25:20] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2022-05-14 15:25:20] [INFO ] Transformed 498 places.
[2022-05-14 15:25:20] [INFO ] Transformed 833 transitions.
[2022-05-14 15:25:20] [INFO ] Parsed PT model containing 498 places and 833 transitions in 115 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 833 rows 498 cols
[2022-05-14 15:25:20] [INFO ] Computed 56 place invariants in 38 ms
FORMULA CSRepetitions-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-05 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-07-UpperBounds-01 49 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 97 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 11) seen :126
FORMULA CSRepetitions-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-06 49 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-04 49 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :25
// Phase 1: matrix 833 rows 498 cols
[2022-05-14 15:25:21] [INFO ] Computed 56 place invariants in 12 ms
[2022-05-14 15:25:21] [INFO ] [Real]Absence check using 56 positive place invariants in 47 ms returned sat
[2022-05-14 15:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:21] [INFO ] [Real]Absence check using state equation in 182 ms returned unsat
[2022-05-14 15:25:21] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned unsat
[2022-05-14 15:25:21] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned unsat
[2022-05-14 15:25:21] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2022-05-14 15:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:22] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-05-14 15:25:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 15:25:22] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2022-05-14 15:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:22] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-14 15:25:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-14 15:25:22] [INFO ] [Nat]Added 49 Read/Feed constraints in 19 ms returned sat
[2022-05-14 15:25:22] [INFO ] Computed and/alt/rep : 784/1127/784 causal constraints (skipped 0 transitions) in 97 ms.
[2022-05-14 15:25:23] [INFO ] Added : 140 causal constraints over 28 iterations in 1346 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, -1] Max seen :[7, 7, 7, 6]
FORMULA CSRepetitions-PT-07-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-PT-07-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 20900 steps, including 135 resets, run finished after 149 ms. (steps per millisecond=140 ) properties (out of 1) seen :7 could not realise parikh vector
Support contains 1 out of 498 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 498/498 places, 833/833 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 498 transition count 785
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 400 transition count 736
Discarding 336 places :
Symmetric choice reduction at 1 with 336 rule applications. Total rules 531 place count 64 transition count 400
Iterating global reduction 1 with 336 rules applied. Total rules applied 867 place count 64 transition count 400
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 907 place count 24 transition count 120
Iterating global reduction 1 with 40 rules applied. Total rules applied 947 place count 24 transition count 120
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 987 place count 24 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 21 rules applied. Total rules applied 1008 place count 10 transition count 73
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (trivial) has 16 edges and 10 vertex of which 9 / 10 are part of one of the 1 SCC in 16 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 55 rules applied. Total rules applied 1063 place count 2 transition count 19
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1079 place count 2 transition count 3
Applied a total of 1079 rules in 179 ms. Remains 2 /498 variables (removed 496) and now considering 3/833 (removed 830) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/498 places, 3/833 transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-14 15:25:24] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 30448 resets, run finished after 240 ms. (steps per millisecond=4166 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 10751 resets, run finished after 188 ms. (steps per millisecond=5319 ) properties (out of 1) seen :7
// Phase 1: matrix 3 rows 2 cols
[2022-05-14 15:25:24] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-14 15:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 15:25:24] [INFO ] [Real]Absence check using state equation in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [7] Max seen :[7]
FORMULA CSRepetitions-PT-07-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652541935361

--------------------
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="CSRepetitions-PT-07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is CSRepetitions-PT-07, 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 r028-tall-165251936300244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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