fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r233-tall-165286037100090
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ShieldIIPt-PT-004B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
247.768 6337.00 13315.00 238.30 FFTTFTTTTFTTFFTT normal

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.r233-tall-165286037100090.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 ShieldIIPt-PT-004B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.5K Apr 29 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 29 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 29 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 29 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 67K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655071080789

Running Version 0
[2022-06-12 21:58:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-06-12 21:58:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:58:02] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-06-12 21:58:02] [INFO ] Transformed 283 places.
[2022-06-12 21:58:02] [INFO ] Transformed 263 transitions.
[2022-06-12 21:58:02] [INFO ] Found NUPN structural information;
[2022-06-12 21:58:02] [INFO ] Parsed PT model containing 283 places and 263 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :12
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 263 rows 283 cols
[2022-06-12 21:58:02] [INFO ] Computed 37 place invariants in 22 ms
[2022-06-12 21:58:02] [INFO ] [Real]Absence check using 37 positive place invariants in 14 ms returned sat
[2022-06-12 21:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:58:03] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-06-12 21:58:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:58:03] [INFO ] [Nat]Absence check using 37 positive place invariants in 14 ms returned sat
[2022-06-12 21:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:58:03] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 3 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:58:03] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:58:04] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 733 ms
[2022-06-12 21:58:04] [INFO ] Computed and/alt/rep : 262/395/262 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:58:05] [INFO ] Added : 257 causal constraints over 53 iterations in 1382 ms. Result :unsat
[2022-06-12 21:58:05] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2022-06-12 21:58:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:58:05] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-06-12 21:58:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:58:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 16 ms returned sat
[2022-06-12 21:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:58:05] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2022-06-12 21:58:05] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:58:06] [INFO ] Deduced a trap composed of 18 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:58:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 346 ms
[2022-06-12 21:58:06] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned unsat
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-004B-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1655071087126

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="ShieldIIPt-PT-004B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPt-PT-004B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037100090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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