fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r191-tall-167838876100016
Last Updated
May 14, 2023

About the Execution of 2022-gold for Election2020-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
196.995 3011.00 6358.00 74.70 13 3 538 8 20 3 3 11 4 4 7 8 538 9 6 11 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r191-tall-167838876100016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Election2020-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876100016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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 Election2020-PT-none-UpperBounds-00
FORMULA_NAME Election2020-PT-none-UpperBounds-01
FORMULA_NAME Election2020-PT-none-UpperBounds-02
FORMULA_NAME Election2020-PT-none-UpperBounds-03
FORMULA_NAME Election2020-PT-none-UpperBounds-04
FORMULA_NAME Election2020-PT-none-UpperBounds-05
FORMULA_NAME Election2020-PT-none-UpperBounds-06
FORMULA_NAME Election2020-PT-none-UpperBounds-07
FORMULA_NAME Election2020-PT-none-UpperBounds-08
FORMULA_NAME Election2020-PT-none-UpperBounds-09
FORMULA_NAME Election2020-PT-none-UpperBounds-10
FORMULA_NAME Election2020-PT-none-UpperBounds-11
FORMULA_NAME Election2020-PT-none-UpperBounds-12
FORMULA_NAME Election2020-PT-none-UpperBounds-13
FORMULA_NAME Election2020-PT-none-UpperBounds-14
FORMULA_NAME Election2020-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678564020707

Running Version 202205111006
[2023-03-11 19:47:02] [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]
[2023-03-11 19:47:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:47:02] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-11 19:47:02] [INFO ] Transformed 53 places.
[2023-03-11 19:47:02] [INFO ] Transformed 102 transitions.
[2023-03-11 19:47:02] [INFO ] Parsed PT model containing 53 places and 102 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 102 rows 53 cols
[2023-03-11 19:47:02] [INFO ] Computed 1 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 163 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :886
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :766
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :776
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :648
FORMULA Election2020-PT-none-UpperBounds-02 538 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :461
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :405
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :442
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :413
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :365
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :434
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :368
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :441
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :648
FORMULA Election2020-PT-none-UpperBounds-12 538 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 14) seen :110
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :110
// Phase 1: matrix 102 rows 53 cols
[2023-03-11 19:47:02] [INFO ] Computed 1 place invariants in 7 ms
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-11 19:47:02] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-11 19:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 47 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 75 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 30 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 19:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:47:03] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [13, 3, 8, 20, 3, 3, 11, 4, 4, 7, 8, 9, 6, 11] Max seen :[13, 3, 8, 20, 3, 3, 11, 4, 4, 7, 8, 9, 6, 11]
FORMULA Election2020-PT-none-UpperBounds-15 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-13 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-03 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Election2020-PT-none-UpperBounds-00 13 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1643 ms.

BK_STOP 1678564023718

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="Election2020-PT-none"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is Election2020-PT-none, 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 r191-tall-167838876100016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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