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.r320-tall-171662352000091.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 greatspnxred
Input is RERS17pb113-PT-5, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r320-tall-171662352000091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M 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

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1716753983213

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb113-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 20:06:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-26 20:06:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 20:06:25] [INFO ] Load time of PNML (sax parser for PT used): 621 ms
[2024-05-26 20:06:25] [INFO ] Transformed 639 places.
[2024-05-26 20:06:25] [INFO ] Transformed 31353 transitions.
[2024-05-26 20:06:25] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 831 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 19 ms.90595KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 13 rules in 894 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 912 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 1032302 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=34 )
[2024-05-26 20:06:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2024-05-26 20:06:56] [INFO ] Computed 13 invariants in 104 ms
[2024-05-26 20:07:00] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2024-05-26 20:07:11] [INFO ] [Real]Absence check using state equation in 10539 ms returned sat
[2024-05-26 20:07:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 20:07:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-26 20:07:42] [INFO ] [Nat]Absence check using state equation in 27493 ms returned sat
[2024-05-26 20:07:42] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-26 20:07:55] [INFO ] [Nat]Added 268 Read/Feed constraints in 12342 ms returned sat
[2024-05-26 20:07:56] [INFO ] Deduced a trap composed of 64 places in 1400 ms of which 21 ms to minimize.
[2024-05-26 20:07:59] [INFO ] Deduced a trap composed of 40 places in 1252 ms of which 3 ms to minimize.
[2024-05-26 20:08:00] [INFO ] Deduced a trap composed of 64 places in 1374 ms of which 3 ms to minimize.
[2024-05-26 20:08:02] [INFO ] Deduced a trap composed of 40 places in 1073 ms of which 4 ms to minimize.
[2024-05-26 20:08:04] [INFO ] Deduced a trap composed of 24 places in 1604 ms of which 3 ms to minimize.
[2024-05-26 20:08:06] [INFO ] Deduced a trap composed of 40 places in 1334 ms of which 2 ms to minimize.
[2024-05-26 20:08:08] [INFO ] Deduced a trap composed of 40 places in 1658 ms of which 3 ms to minimize.
[2024-05-26 20:08:10] [INFO ] Deduced a trap composed of 65 places in 1768 ms of which 3 ms to minimize.
[2024-05-26 20:08:12] [INFO ] Deduced a trap composed of 48 places in 1670 ms of which 2 ms to minimize.
[2024-05-26 20:08:14] [INFO ] Deduced a trap composed of 48 places in 1330 ms of which 2 ms to minimize.
[2024-05-26 20:08:16] [INFO ] Deduced a trap composed of 64 places in 1399 ms of which 2 ms to minimize.
[2024-05-26 20:08:18] [INFO ] Deduced a trap composed of 64 places in 1191 ms of which 1 ms to minimize.
[2024-05-26 20:08:19] [INFO ] Deduced a trap composed of 64 places in 907 ms of which 1 ms to minimize.
[2024-05-26 20:08:20] [INFO ] Deduced a trap composed of 48 places in 868 ms of which 1 ms to minimize.
[2024-05-26 20:08:21] [INFO ] Deduced a trap composed of 48 places in 592 ms of which 1 ms to minimize.
[2024-05-26 20:08:23] [INFO ] Deduced a trap composed of 64 places in 1119 ms of which 1 ms to minimize.
[2024-05-26 20:08:24] [INFO ] Deduced a trap composed of 40 places in 432 ms of which 0 ms to minimize.
[2024-05-26 20:08:25] [INFO ] Deduced a trap composed of 64 places in 569 ms of which 0 ms to minimize.
[2024-05-26 20:08:26] [INFO ] Deduced a trap composed of 64 places in 679 ms of which 0 ms to minimize.
[2024-05-26 20:08:30] [INFO ] Deduced a trap composed of 48 places in 546 ms of which 1 ms to minimize.
[2024-05-26 20:08:31] [INFO ] Deduced a trap composed of 40 places in 391 ms of which 1 ms to minimize.
[2024-05-26 20:08:35] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 40057 ms
[2024-05-26 20:08:37] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2477 ms.
[2024-05-26 20:08:38] [INFO ] Added : 0 causal constraints over 0 iterations in 3653 ms. Result :sat
Parikh directed walk for 909200 steps, including 1000 resets, run took 27876 ms. (steps per millisecond=32 )
Random directed walk for 500001 steps, including 0 resets, run took 20475 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 14285 ms (no deadlock found). (steps per millisecond=35 )
Random directed walk for 500022 steps, including 0 resets, run took 20368 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 14145 ms (no deadlock found). (steps per millisecond=35 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 243 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2024-05-26 20:10:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-26 20:10:16] [INFO ] Invariant cache hit.
[2024-05-26 20:10:18] [INFO ] Implicit Places using invariants in 1984 ms returned []
Implicit Place search using SMT only with invariants took 1987 ms to find 0 implicit places.
Running 31351 sub problems to find dead transitions.
[2024-05-26 20:10:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2024-05-26 20:10:18] [INFO ] Invariant cache hit.
[2024-05-26 20:10:19] [INFO ] State equation strengthened by 268 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RERS17pb113-PT-5

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 639
TRANSITIONS: 31353
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.681s, Sys 0.072s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.110s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 590
MODEL NAME: /home/mcc/execution/model
639 places, 31353 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -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="RERS17pb113-PT-5"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 greatspnxred"
echo " Input is RERS17pb113-PT-5, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r320-tall-171662352000091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-5.tgz
mv RERS17pb113-PT-5 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;