fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r199-smll-167840346100533
Last Updated
May 14, 2023

About the Execution of LoLa+red for HouseConstruction-PT-00010

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
221.123 6400.00 11421.00 474.60 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 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.r199-smll-167840346100533.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 lolaxred
Input is HouseConstruction-PT-00010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346100533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 HouseConstruction-PT-00010-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-00010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678561252441

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-00010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 19:00:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 19:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 19:00:56] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-11 19:00:56] [INFO ] Transformed 26 places.
[2023-03-11 19:00:56] [INFO ] Transformed 18 transitions.
[2023-03-11 19:00:56] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 19:00:56] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10005 steps, including 50 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :160
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :25
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :109
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :34
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :99
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :92
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :60
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :92
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :89
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :102
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :34
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :91
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :96
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :104
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :95
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :102
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :92
[2023-03-11 19:00:56] [INFO ] Invariant cache hit.
[2023-03-11 19:00:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 13 ms returned sat
[2023-03-11 19:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:56] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2023-03-11 19:00:56] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:56] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 19 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-11 19:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 19:00:57] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
FORMULA HouseConstruction-PT-00010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1801 ms.
ITS solved all properties within timeout

BK_STOP 1678561258841

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="HouseConstruction-PT-00010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HouseConstruction-PT-00010, 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 r199-smll-167840346100533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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