fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690532300430
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Sudoku-COL-AN03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
257.371 3256.00 7550.00 78.50 TFFTFTTFTTTTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532300430.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-COL-AN03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532300430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K Apr 12 10:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 10:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 10:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 10:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 10:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 10:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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-COL-AN03-ReachabilityCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN03-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717256598205

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:43:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:43:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:43:19] [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.
[2024-06-01 15:43:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:43:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 508 ms
[2024-06-01 15:43:20] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:43:20] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 15:43:20] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
RANDOM walk for 40000 steps (3636 resets) in 866 ms. (46 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 508 ms. (78 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 266 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 340 ms. (117 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3636 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 15:43:21] [INFO ] Computed 3 invariants in 3 ms
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-02 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-04 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-06 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-08 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-10 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-12 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-13 is UNSAT
Problem Sudoku-COL-AN03-ReachabilityCardinality-2024-14 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 8 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 15:43:21] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:43:21] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-06 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
Domain [N(3), N(3)] of place Rows breaks symmetries in sort N
[2024-06-01 15:43:21] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions 108 arcs in 8 ms.
[2024-06-01 15:43:21] [INFO ] Unfolded 15 HLPN properties in 2 ms.
RANDOM walk for 98 steps (8 resets) in 22 ms. (4 steps per ms) remains 0/7 properties
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Sudoku-COL-AN03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2023 ms.
ITS solved all properties within timeout

BK_STOP 1717256601461

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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-AN03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN03, 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 r536-tall-171690532300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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