Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r215-oct2-165281606000220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 SharedMemory-COL-000200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-oct2-165281606000220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 8.3K Apr 30 21:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 30 21:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 08:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 20K May 10 09:34 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 SharedMemory-COL-000200-UpperBounds-00
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-01
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-02
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-03
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-04
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-05
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-06
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-07
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-08
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-09
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-10
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-11
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-12
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-13
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-14
FORMULA_NAME SharedMemory-COL-000200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653212940465

Running Version 0
[2022-05-22 09:49:01] [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-22 09:49:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 09:49:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-22 09:49:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-22 09:49:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 440 ms
[2022-05-22 09:49:02] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 40801 PT places and 120400.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2022-05-22 09:49:02] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions in 3 ms.
[2022-05-22 09:49:02] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_13548123905371912172.dot
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 09:49:02] [INFO ] Computed 3 place invariants in 6 ms
FORMULA SharedMemory-COL-000200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-10 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-09 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-05 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-03 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SharedMemory-COL-000200-UpperBounds-00 200 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2022-05-22 09:49:02] [INFO ] Unfolded HLPN to a Petri net with 40801 places and 80400 transitions in 366 ms.
[2022-05-22 09:49:02] [INFO ] Unfolded HLPN properties in 5 ms.
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 09:49:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 09:49:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-22 09:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 09:49:02] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 09:49:02] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2022-05-22 09:49:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-22 09:49:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-22 09:49:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:49:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-22 09:49:02] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 09:49:02] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-22 09:49:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 09:49:03] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 09:49:03] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 09:49:03] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 09:49:03] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 1 ms.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 09:49:03] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 09:49:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 09:49:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 09:49:03] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 09:49:03] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [200, 200, 200, 1, 200, 200, 1]
[2022-05-22 09:49:03] [INFO ] Unfolded HLPN to a Petri net with 40801 places and 80400 transitions in 174 ms.
[2022-05-22 09:49:03] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_1378506402928265822.dot
Deduced a syphon composed of 200 places in 43 ms
Reduce places removed 200 places and 200 transitions.
Interrupted random walk after 1056 steps, including 0 resets, run timeout after 30127 ms. (steps per millisecond=0 ) properties seen :{0=62, 1=199, 2=199, 3=1, 4=62, 5=62, 6=1}
FORMULA SharedMemory-COL-000200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :27
// Phase 1: matrix 80200 rows 40601 cols
[2022-05-22 09:50:04] [INFO ] Computed 401 place invariants in 29510 ms
Current structural bounds on expressions (after SMT) : [200, 200, 200, 200, 200] Max seen :[62, 199, 199, 62, 62]
Support contains 400 out of 40601 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40601/40601 places, 80200/80200 transitions.
Performed 35947 Post agglomeration using F-continuation condition.
Performed 39800 Post agglomeration using F-continuation condition.Transition count delta: 39800
Iterating post reduction 0 with 39800 rules applied. Total rules applied 39800 place count 40601 transition count 40400
Reduce places removed 40001 places and 0 transitions.
Ensure Unique test removed 39600 transitions
Reduce isomorphic transitions removed 39600 transitions.
Iterating post reduction 1 with 79601 rules applied. Total rules applied 119401 place count 600 transition count 800
Applied a total of 119401 rules in 32448 ms. Remains 600 /40601 variables (removed 40001) and now considering 800/80200 (removed 79400) transitions.
Finished structural reductions, in 1 iterations. Remains : 600/40601 places, 800/80200 transitions.
// Phase 1: matrix 800 rows 600 cols
[2022-05-22 09:51:01] [INFO ] Computed 200 place invariants in 3 ms
Interrupted random walk after 651582 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{0=96, 1=94, 2=94, 3=96, 4=96}
Interrupted Best-First random walk after 919802 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen :{0=200, 3=200, 4=200}
FORMULA SharedMemory-COL-000200-UpperBounds-11 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-08 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-02 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 929474 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :{0=200, 1=200}
FORMULA SharedMemory-COL-000200-UpperBounds-06 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SharedMemory-COL-000200-UpperBounds-04 200 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

BK_STOP 1653213124769

--------------------
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="SharedMemory-COL-000200"
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 SharedMemory-COL-000200, 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 r215-oct2-165281606000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000200.tgz
mv SharedMemory-COL-000200 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 ;