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

About the Execution of Smart+red for AirplaneLD-PT-1000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
644.815 68147.00 84464.00 55.90 1 1 1 1 1 1 1000 1 1 1 1 1 1 1 1 1 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.r011-oct2-167813600000293.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is AirplaneLD-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813600000293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 589K Feb 26 12:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 12:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 235K Feb 26 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 425K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 103K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 450K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.3M Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 554K Feb 26 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 168K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.3M 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 AirplaneLD-PT-1000-UpperBounds-00
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-01
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-02
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-03
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-04
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-05
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-06
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-07
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-08
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-09
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-10
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-11
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-12
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-13
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-14
FORMULA_NAME AirplaneLD-PT-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678731644305

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-1000
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 18:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 18:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:20:48] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2023-03-13 18:20:48] [INFO ] Transformed 7019 places.
[2023-03-13 18:20:48] [INFO ] Transformed 8008 transitions.
[2023-03-13 18:20:48] [INFO ] Parsed PT model containing 7019 places and 8008 transitions and 30528 arcs in 593 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 74 ms.
Reduce places removed 3002 places and 0 transitions.
FORMULA AirplaneLD-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 8008 rows 4017 cols
[2023-03-13 18:20:50] [INFO ] Computed 3 place invariants in 1629 ms
FORMULA AirplaneLD-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-1000-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 2546 ms. (steps per millisecond=3 ) properties (out of 12) seen :12
FORMULA AirplaneLD-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :3
[2023-03-13 18:20:53] [INFO ] Invariant cache hit.
[2023-03-13 18:20:54] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2023-03-13 18:20:54] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 24 ms returned sat
[2023-03-13 18:20:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:20:58] [INFO ] [Real]Absence check using state equation in 3895 ms returned unknown
[2023-03-13 18:20:58] [INFO ] [Real]Absence check using 2 positive place invariants in 31 ms returned sat
[2023-03-13 18:20:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-13 18:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:01] [INFO ] [Real]Absence check using state equation in 2484 ms returned unsat
[2023-03-13 18:21:02] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2023-03-13 18:21:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 18:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:04] [INFO ] [Real]Absence check using state equation in 2871 ms returned unsat
[2023-03-13 18:21:05] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2023-03-13 18:21:05] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned unsat
[2023-03-13 18:21:05] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned unsat
[2023-03-13 18:21:06] [INFO ] [Real]Absence check using 2 positive place invariants in 86 ms returned sat
[2023-03-13 18:21:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 18:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:08] [INFO ] [Real]Absence check using state equation in 1611 ms returned unsat
[2023-03-13 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2023-03-13 18:21:08] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 18:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:09] [INFO ] [Real]Absence check using state equation in 997 ms returned unsat
[2023-03-13 18:21:10] [INFO ] [Real]Absence check using 2 positive place invariants in 28 ms returned sat
[2023-03-13 18:21:10] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-13 18:21:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:13] [INFO ] [Real]Absence check using state equation in 2983 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA AirplaneLD-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA AirplaneLD-PT-1000-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2000 out of 4017 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4017/4017 places, 8008/8008 transitions.
Graph (complete) has 10523 edges and 4017 vertex of which 2008 are kept as prefixes of interest. Removing 2009 places using SCC suffix rule.37 ms
Discarding 2009 places :
Also discarding 4000 output transitions
Drop transitions removed 4000 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 2008 transition count 4004
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 2008 transition count 4000
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 15 place count 2002 transition count 4000
Applied a total of 15 rules in 310 ms. Remains 2002 /4017 variables (removed 2015) and now considering 4000/8008 (removed 4008) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 2002/4017 places, 4000/8008 transitions.
// Phase 1: matrix 4000 rows 2002 cols
[2023-03-13 18:21:14] [INFO ] Computed 1 place invariants in 764 ms
Finished random walk after 89863 steps, including 29954 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 303454 steps, including 151 resets, run visited all 1 properties in 5011 ms. (steps per millisecond=60 )
[2023-03-13 18:21:49] [INFO ] Invariant cache hit.
[2023-03-13 18:21:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 18 ms returned sat
[2023-03-13 18:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 18:21:52] [INFO ] [Real]Absence check using state equation in 2119 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA AirplaneLD-PT-1000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 64610 ms.
ITS solved all properties within timeout

BK_STOP 1678731712452

--------------------
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="AirplaneLD-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is AirplaneLD-PT-1000, 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 r011-oct2-167813600000293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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