fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r178-tajo-158987882500518
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Diffusion2D-PT-D30N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.910 3600000.00 88198.00 70.90 TTFFTFTTTFTTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882500518.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is Diffusion2D-PT-D30N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882500518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 4.6K Mar 31 06:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 29 22:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 28 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 07:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.0M Mar 24 05:37 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D30N150-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591225344902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:02:26] [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]
[2020-06-03 23:02:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:02:26] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2020-06-03 23:02:26] [INFO ] Transformed 900 places.
[2020-06-03 23:02:26] [INFO ] Transformed 6844 transitions.
[2020-06-03 23:02:26] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 239 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10138 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1126 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6844 rows 900 cols
[2020-06-03 23:02:26] [INFO ] Computed 1 place invariants in 55 ms
[2020-06-03 23:02:27] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2020-06-03 23:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:31] [INFO ] [Real]Absence check using state equation in 4849 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 23:02:32] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 23:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:36] [INFO ] [Real]Absence check using state equation in 4884 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 23:02:37] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 23:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:02:42] [INFO ] [Real]Absence check using state equation in 4936 ms returned (error "Failed to check-sat")
[2020-06-03 23:02:42] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 23:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:02:47] [INFO ] [Real]Absence check using state equation in 4903 ms returned (error "Failed to check-sat")
[2020-06-03 23:02:47] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2020-06-03 23:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:02:52] [INFO ] [Real]Absence check using state equation in 4902 ms returned unknown
[2020-06-03 23:02:52] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2020-06-03 23:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:02:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:02:57] [INFO ] [Real]Absence check using state equation in 4926 ms returned (error "Failed to check-sat")
[2020-06-03 23:02:57] [INFO ] [Real]Absence check using 1 positive place invariants in 16 ms returned sat
[2020-06-03 23:02:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:02] [INFO ] [Real]Absence check using state equation in 4875 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:02] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 23:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:07] [INFO ] [Real]Absence check using state equation in 4904 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:07] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2020-06-03 23:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:12] [INFO ] [Real]Absence check using state equation in 4940 ms returned unknown
[2020-06-03 23:03:12] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2020-06-03 23:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:17] [INFO ] [Real]Absence check using state equation in 4891 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:17] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 23:03:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:22] [INFO ] [Real]Absence check using state equation in 4916 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:22] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 23:03:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:27] [INFO ] [Real]Absence check using state equation in 4915 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:27] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2020-06-03 23:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:32] [INFO ] [Real]Absence check using state equation in 4911 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:32] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 23:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 23:03:37] [INFO ] [Real]Absence check using state equation in 4905 ms returned (error "Failed to check-sat")
[2020-06-03 23:03:37] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2020-06-03 23:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:03:42] [INFO ] [Real]Absence check using state equation in 4911 ms returned (error "Solver has unexpectedly terminated")
Support contains 75 out of 900 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 5764 edges and 900 vertex of which 825 / 900 are part of one of the 1 SCC in 24 ms
Free SCC test removed 824 places
Drop transitions removed 5764 transitions
Ensure Unique test removed 862 transitions
Reduce isomorphic transitions removed 6626 transitions.
Iterating post reduction 0 with 6626 rules applied. Total rules applied 6627 place count 76 transition count 218
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 1 with 84 rules applied. Total rules applied 6711 place count 76 transition count 134
Applied a total of 6711 rules in 93 ms. Remains 76 /900 variables (removed 824) and now considering 134/6844 (removed 6710) transitions.
Finished structural reductions, in 1 iterations. Remains : 76/900 places, 134/6844 transitions.
Incomplete random walk after 1000015 steps, including 0 resets, run finished after 179 ms. (steps per millisecond=5586 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0]
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties seen :[1, 0, 1]
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 2040 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1020 )
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Diffusion2D-PT-D30N150, 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 r178-tajo-158987882500518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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