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

About the Execution of 2021-gold for Sudoku-PT-AN09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
257.899 14744.00 22739.00 123.30 TTTTFTTTTFFFTTTT 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.r269-tall-165303553300101.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 Sudoku-PT-AN09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r269-tall-165303553300101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 487K Apr 30 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 30 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 827K Apr 30 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 30 11:39 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 139K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 468K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 322K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 667K Apr 30 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Apr 30 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 308K Apr 30 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 30 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 114K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 416K 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 Sudoku-PT-AN09-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068736053

Running Version 0
[2022-06-12 21:18:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:18:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:18:57] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-06-12 21:18:57] [INFO ] Transformed 972 places.
[2022-06-12 21:18:57] [INFO ] Transformed 729 transitions.
[2022-06-12 21:18:57] [INFO ] Parsed PT model containing 972 places and 729 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 273 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 142 resets, run finished after 1331 ms. (steps per millisecond=7 ) properties (out of 16) seen :5
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1336 ms. (steps per millisecond=7 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 794 ms. (steps per millisecond=12 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2337 ms. (steps per millisecond=4 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2077 ms. (steps per millisecond=4 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 729 rows 972 cols
[2022-06-12 21:19:06] [INFO ] Computed 243 place invariants in 27 ms
[2022-06-12 21:19:07] [INFO ] [Real]Absence check using 243 positive place invariants in 435 ms returned sat
[2022-06-12 21:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:07] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-12 21:19:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:07] [INFO ] [Nat]Absence check using 243 positive place invariants in 148 ms returned sat
[2022-06-12 21:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:08] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-06-12 21:19:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 32 ms.
[2022-06-12 21:19:08] [INFO ] Added : 0 causal constraints over 0 iterations in 137 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:19:08] [INFO ] [Real]Absence check using 243 positive place invariants in 132 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 17 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 28 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 8 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 19 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 85 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 30 ms returned unsat
[2022-06-12 21:19:09] [INFO ] [Real]Absence check using 243 positive place invariants in 35 ms returned unsat
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Finished Parikh walk after 81 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
FORMULA Sudoku-PT-AN09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068750797

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Sudoku-PT-AN09"
export BK_EXAMINATION="ReachabilityCardinality"
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 Sudoku-PT-AN09, 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 r269-tall-165303553300101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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