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.r151-tall-162089151200175.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 NoC3x3-PT-8B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K 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 3.4K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 NoC3x3-PT-8B-ReachabilityCardinality-00
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-01
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-02
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-03
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-04
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-05
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-06
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-07
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-08
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-09
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-10
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-11
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-12
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-13
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-14
FORMULA_NAME NoC3x3-PT-8B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621003046950

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 14:37:28] [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-14 14:37:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 14:37:28] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2021-05-14 14:37:28] [INFO ] Transformed 9140 places.
[2021-05-14 14:37:28] [INFO ] Transformed 14577 transitions.
[2021-05-14 14:37:28] [INFO ] Found NUPN structural information;
[2021-05-14 14:37:29] [INFO ] Parsed PT model containing 9140 places and 14577 transitions in 479 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 264 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 174 ms. (steps per millisecond=57 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 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 10001 steps, including 0 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 14577 rows 9140 cols
[2021-05-14 14:37:30] [INFO ] Computed 99 place invariants in 394 ms
[2021-05-14 14:37:32] [INFO ] [Real]Absence check using 99 positive place invariants in 915 ms returned sat
[2021-05-14 14:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:37:35] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:37:35] [INFO ] [Real]Absence check using state equation in 2564 ms returned (error "Failed to check-sat")
[2021-05-14 14:37:37] [INFO ] [Real]Absence check using 99 positive place invariants in 880 ms returned sat
[2021-05-14 14:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:37:40] [INFO ] [Real]Absence check using state equation in 3031 ms returned (error "Solver has unexpectedly terminated")
[2021-05-14 14:37:42] [INFO ] [Real]Absence check using 99 positive place invariants in 876 ms returned sat
[2021-05-14 14:37:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:37:45] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:37:45] [INFO ] [Real]Absence check using state equation in 3013 ms returned (error "Failed to check-sat")
[2021-05-14 14:37:47] [INFO ] [Real]Absence check using 99 positive place invariants in 877 ms returned sat
[2021-05-14 14:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:37:50] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:37:50] [INFO ] [Real]Absence check using state equation in 3048 ms returned (error "Failed to check-sat")
[2021-05-14 14:37:52] [INFO ] [Real]Absence check using 99 positive place invariants in 868 ms returned sat
[2021-05-14 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:37:55] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:37:55] [INFO ] [Real]Absence check using state equation in 3108 ms returned (error "Failed to check-sat")
[2021-05-14 14:37:57] [INFO ] [Real]Absence check using 99 positive place invariants in 871 ms returned sat
[2021-05-14 14:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:00] [INFO ] [Real]Absence check using state equation in 3062 ms returned (error "Failed to check-sat")
[2021-05-14 14:38:02] [INFO ] [Real]Absence check using 99 positive place invariants in 878 ms returned sat
[2021-05-14 14:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 14:38:05] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 14:38:05] [INFO ] [Real]Absence check using state equation in 3059 ms returned (error "Failed to check-sat")
Support contains 23 out of 9140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9140/9140 places, 14577/14577 transitions.
Graph (trivial) has 13687 edges and 9140 vertex of which 2371 / 9140 are part of one of the 33 SCC in 45 ms
Free SCC test removed 2338 places
Discarding 113 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 12330 edges and 6802 vertex of which 6689 are kept as prefixes of interest. Removing 113 places using SCC suffix rule.30 ms
Drop transitions removed 3724 transitions
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 3828 transitions.
Performed 4200 Post agglomeration using F-continuation condition.Transition count delta: 4200
Iterating post reduction 0 with 8028 rules applied. Total rules applied 8030 place count 6689 transition count 6469
Reduce places removed 4200 places and 0 transitions.
Ensure Unique test removed 2364 transitions
Reduce isomorphic transitions removed 2364 transitions.
Performed 1190 Post agglomeration using F-continuation condition.Transition count delta: 1190
Iterating post reduction 1 with 7754 rules applied. Total rules applied 15784 place count 2489 transition count 2915
Reduce places removed 1190 places and 0 transitions.
Ensure Unique test removed 1190 transitions
Reduce isomorphic transitions removed 1190 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 2410 rules applied. Total rules applied 18194 place count 1299 transition count 1695
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 18224 place count 1269 transition count 1695
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 18224 place count 1269 transition count 1653
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 18308 place count 1227 transition count 1653
Symmetric choice reduction at 4 with 356 rule applications. Total rules 18664 place count 1227 transition count 1653
Deduced a syphon composed of 356 places in 4 ms
Reduce places removed 356 places and 356 transitions.
Iterating global reduction 4 with 712 rules applied. Total rules applied 19376 place count 871 transition count 1297
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 4 with 53 rules applied. Total rules applied 19429 place count 871 transition count 1244
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 60 Pre rules applied. Total rules applied 19429 place count 871 transition count 1184
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 19549 place count 811 transition count 1184
Symmetric choice reduction at 5 with 47 rule applications. Total rules 19596 place count 811 transition count 1184
Deduced a syphon composed of 47 places in 8 ms
Reduce places removed 47 places and 65 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 19690 place count 764 transition count 1119
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 19708 place count 764 transition count 1101
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Deduced a syphon composed of 240 places in 2 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 6 with 480 rules applied. Total rules applied 20188 place count 524 transition count 861
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 25 rules applied. Total rules applied 20213 place count 524 transition count 836
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 20227 place count 517 transition count 868
Free-agglomeration rule applied 213 times.
Iterating global reduction 7 with 213 rules applied. Total rules applied 20440 place count 517 transition count 655
Reduce places removed 213 places and 0 transitions.
Drop transitions removed 47 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 48 transitions.
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 990 edges and 304 vertex of which 299 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Iterating post reduction 7 with 262 rules applied. Total rules applied 20702 place count 299 transition count 607
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 20707 place count 299 transition count 602
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 20731 place count 299 transition count 602
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 20733 place count 299 transition count 602
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 20735 place count 299 transition count 600
Drop transitions removed 137 transitions
Redundant transition composition rules discarded 137 transitions
Iterating global reduction 10 with 137 rules applied. Total rules applied 20872 place count 299 transition count 463
Reduce places removed 1 places and 0 transitions.
Discarding 13 places :
Also discarding 0 output transitions
Graph (complete) has 852 edges and 298 vertex of which 285 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Iterating post reduction 10 with 2 rules applied. Total rules applied 20874 place count 285 transition count 463
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 20887 place count 285 transition count 450
Symmetric choice reduction at 12 with 5 rule applications. Total rules 20892 place count 285 transition count 450
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 20902 place count 280 transition count 445
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 20904 place count 280 transition count 445
Applied a total of 20904 rules in 1617 ms. Remains 280 /9140 variables (removed 8860) and now considering 445/14577 (removed 14132) transitions.
Finished structural reductions, in 1 iterations. Remains : 280/9140 places, 445/14577 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3638 ms. (steps per millisecond=274 ) properties seen :[1, 1, 1, 1, 0, 1, 1]
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2417 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=483 )
FORMULA NoC3x3-PT-8B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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="NoC3x3-PT-8B"
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 NoC3x3-PT-8B, 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 r151-tall-162089151200175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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