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.r132-tall-162075428300167.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 gold2020
Input is IBM5964-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428300167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 139K 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 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.8K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K 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 5.7K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 171K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620915914459

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 14:25:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 14:25:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:25:16] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-13 14:25:16] [INFO ] Transformed 263 places.
[2021-05-13 14:25:16] [INFO ] Transformed 139 transitions.
[2021-05-13 14:25:16] [INFO ] Parsed PT model containing 263 places and 139 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 216 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA IBM5964-PT-none-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 139 rows 263 cols
[2021-05-13 14:25:16] [INFO ] Computed 128 place invariants in 13 ms
[2021-05-13 14:25:16] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2021-05-13 14:25:16] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 53 ms returned sat
[2021-05-13 14:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2021-05-13 14:25:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:25:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 35 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 23 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 41 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 14:25:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:25:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 41 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 39 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 47 ms returned sat
[2021-05-13 14:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:17] [INFO ] [Real]Absence check using state equation in 95 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 40 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 14:25:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:25:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 17 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 18 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 7 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 39 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-13 14:25:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:25:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 28 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 24 ms returned unsat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 37 ms returned sat
[2021-05-13 14:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 14:25:19] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-13 14:25:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 14:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-13 14:25:19] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
FORMULA IBM5964-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA IBM5964-PT-none-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

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="IBM5964-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
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 gold2020"
echo " Input is IBM5964-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-162075428300167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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