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

About the Execution of 2022-gold for Sudoku-COL-AN09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
285.663 8422.00 13830.00 101.60 81 81 81 81 81 81 81 81 81 81 81 81 81 81 81 81 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.r511-tall-167912735500009.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 Sudoku-COL-AN09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735500009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 08:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 08:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 09:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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 Sudoku-COL-AN09-UpperBounds-00
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-01
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-02
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-03
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-04
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-05
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-06
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-07
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-08
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-09
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-10
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-11
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-12
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-13
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-14
FORMULA_NAME Sudoku-COL-AN09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679319487522

Running Version 202205111006
[2023-03-20 13:38:08] [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-20 13:38:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:38:09] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-20 13:38:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-20 13:38:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 533 ms
[2023-03-20 13:38:09] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2023-03-20 13:38:09] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2023-03-20 13:38:09] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-20 13:38:09] [INFO ] Computed 3 place invariants in 9 ms
FORMULA Sudoku-COL-AN09-UpperBounds-15 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-14 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-13 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-12 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-11 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-10 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-09 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-06 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-05 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-04 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-03 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-01 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN09-UpperBounds-00 81 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 1 rows 4 cols
[2023-03-20 13:38:09] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 4 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:09] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-20 13:38:09] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-20 13:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : [81, 81, 81]
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-20 13:38:09] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 28 ms.
[2023-03-20 13:38:09] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 834 ms. (steps per millisecond=11 ) properties (out of 3) seen :222
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 3) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :15
// Phase 1: matrix 729 rows 972 cols
[2023-03-20 13:38:11] [INFO ] Computed 243 place invariants in 33 ms
[2023-03-20 13:38:11] [INFO ] [Real]Absence check using 243 positive place invariants in 147 ms returned sat
[2023-03-20 13:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:12] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-20 13:38:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:12] [INFO ] [Nat]Absence check using 243 positive place invariants in 83 ms returned sat
[2023-03-20 13:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:12] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-20 13:38:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-20 13:38:12] [INFO ] Added : 0 causal constraints over 0 iterations in 116 ms. Result :sat
Minimization took 92 ms.
[2023-03-20 13:38:13] [INFO ] [Real]Absence check using 243 positive place invariants in 109 ms returned sat
[2023-03-20 13:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:13] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-20 13:38:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:13] [INFO ] [Nat]Absence check using 243 positive place invariants in 80 ms returned sat
[2023-03-20 13:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:13] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-20 13:38:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2023-03-20 13:38:14] [INFO ] Added : 0 causal constraints over 0 iterations in 111 ms. Result :sat
Minimization took 92 ms.
[2023-03-20 13:38:14] [INFO ] [Real]Absence check using 243 positive place invariants in 115 ms returned sat
[2023-03-20 13:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:14] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-20 13:38:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 13:38:14] [INFO ] [Nat]Absence check using 243 positive place invariants in 83 ms returned sat
[2023-03-20 13:38:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 13:38:15] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-20 13:38:15] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-20 13:38:15] [INFO ] Added : 0 causal constraints over 0 iterations in 102 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [81, 81, 81] Max seen :[74, 74, 74]
FORMULA Sudoku-COL-AN09-UpperBounds-08 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN09-UpperBounds-07 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN09-UpperBounds-02 81 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 7030 ms.

BK_STOP 1679319495944

--------------------
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="Sudoku-COL-AN09"
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 Sudoku-COL-AN09, 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 r511-tall-167912735500009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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