fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r265-tall-162106800600319
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for Sudoku-PT-AN11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1045.964 3600000.00 108323.00 441.20 FTTFTFTTFTTFTTTF normal

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.r265-tall-162106800600319.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 Sudoku-PT-AN11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800600319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 1.6M May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.2M May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.0M May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 268K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 909K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 700K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 254K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 780K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 257K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 838K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 746K May 5 16:52 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-AN11-ReachabilityCardinality-00
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-01
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-02
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-03
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-04
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-05
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-06
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-07
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-08
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-09
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-10
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-11
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-12
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-13
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-14
FORMULA_NAME Sudoku-PT-AN11-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621216084160

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 01:48:05] [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-17 01:48:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:48:05] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2021-05-17 01:48:05] [INFO ] Transformed 1694 places.
[2021-05-17 01:48:05] [INFO ] Transformed 1331 transitions.
[2021-05-17 01:48:05] [INFO ] Parsed PT model containing 1694 places and 1331 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 165 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1868 ms. (steps per millisecond=5 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1]
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 479 ms. (steps per millisecond=20 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 444 ms. (steps per millisecond=22 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 1173 ms. (steps per millisecond=8 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 70 ms. (steps per millisecond=142 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1331 rows 1694 cols
[2021-05-17 01:48:10] [INFO ] Computed 363 place invariants in 60 ms
[2021-05-17 01:48:13] [INFO ] [Real]Absence check using 363 positive place invariants in 2282 ms returned sat
[2021-05-17 01:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-17 01:48:15] [INFO ] [Real]Absence check using state equation in 2502 ms returned (error "Failed to check-sat")
[2021-05-17 01:48:16] [INFO ] [Real]Absence check using 363 positive place invariants in 570 ms returned unsat
[2021-05-17 01:48:17] [INFO ] [Real]Absence check using 363 positive place invariants in 372 ms returned unsat
[2021-05-17 01:48:19] [INFO ] [Real]Absence check using 363 positive place invariants in 1780 ms returned unsat
[2021-05-17 01:48:19] [INFO ] [Real]Absence check using 363 positive place invariants in 498 ms returned sat
[2021-05-17 01:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:48:24] [INFO ] [Real]Absence check using state equation in 4338 ms returned (error "Solver has unexpectedly terminated")
[2021-05-17 01:48:24] [INFO ] [Real]Absence check using 363 positive place invariants in 31 ms returned unsat
[2021-05-17 01:48:24] [INFO ] [Real]Absence check using 363 positive place invariants in 91 ms returned unsat
[2021-05-17 01:48:24] [INFO ] [Real]Absence check using 363 positive place invariants in 61 ms returned unsat
[2021-05-17 01:48:25] [INFO ] [Real]Absence check using 363 positive place invariants in 219 ms returned unsat
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Discarding 1331 places :
Also discarding 0 output transitions
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.33 ms
Applied a total of 1 rules in 110 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Interrupted random walk after 332192 steps, including 3145 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen :[0, 0]
Interrupted Best-First random walk after 690559 steps, including 16 resets, run timeout after 5002 ms. (steps per millisecond=138 ) properties seen :[0, 0]
Interrupted Best-First random walk after 745249 steps, including 17 resets, run timeout after 5002 ms. (steps per millisecond=148 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2866061 steps, run timeout after 30001 ms. (steps per millisecond=95 ) properties seen :[0, 0]
Probabilistic random walk after 2866061 steps, saw 467126 distinct states, run finished after 30001 ms. (steps per millisecond=95 ) properties seen :[0, 0]
// Phase 1: matrix 1331 rows 363 cols
[2021-05-17 01:49:35] [INFO ] Computed 32 place invariants in 88 ms
[2021-05-17 01:49:35] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 30 ms returned sat
[2021-05-17 01:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:36] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2021-05-17 01:49:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints in 62 ms.
[2021-05-17 01:49:36] [INFO ] Added : 0 causal constraints over 0 iterations in 118 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-17 01:49:36] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned sat
[2021-05-17 01:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:37] [INFO ] [Real]Absence check using state equation in 718 ms returned sat
[2021-05-17 01:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:49:37] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 28 ms returned sat
[2021-05-17 01:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:49:38] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2021-05-17 01:49:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints in 48 ms.
[2021-05-17 01:49:38] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 11900 steps, including 99 resets, run finished after 291 ms. (steps per millisecond=40 ) properties seen :[0, 1] could not realise parikh vector
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 122 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
FORMULA Sudoku-PT-AN11-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_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="Sudoku-PT-AN11"
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 Sudoku-PT-AN11, 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 r265-tall-162106800600319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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