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.r364-tall-171683777800386.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 ShieldPPPt-PT-010B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777800386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 185K 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 1716913917217

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:31:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-28 16:31:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:31:58] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-28 16:31:58] [INFO ] Transformed 783 places.
[2024-05-28 16:31:58] [INFO ] Transformed 713 transitions.
[2024-05-28 16:31:58] [INFO ] Found NUPN structural information;
[2024-05-28 16:31:58] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 211 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 4 ms.20402KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 783/783 places, 713/713 transitions.
Computed a total of 200 stabilizing places and 200 stable transitions
Computed a total of 200 stabilizing places and 200 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 783 transition count 520
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 388 place count 590 transition count 518
Reduce places removed 1 places and 0 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 389 place count 589 transition count 518
Computed a total of 120 stabilizing places and 120 stable transitions
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 389 place count 589 transition count 478
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 469 place count 549 transition count 478
Computed a total of 120 stabilizing places and 120 stable transitions
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 539 place count 479 transition count 408
Iterating global reduction 3 with 70 rules applied. Total rules applied 609 place count 479 transition count 408
Computed a total of 80 stabilizing places and 80 stable transitions
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 609 place count 479 transition count 378
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 669 place count 449 transition count 378
Computed a total of 81 stabilizing places and 80 stable transitions
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 1007 place count 280 transition count 209
Computed a total of 2 stabilizing places and 1 stable transitions
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1065 place count 251 transition count 209
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1066 place count 250 transition count 208
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 1067 place count 249 transition count 208
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1067 place count 249 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1071 place count 247 transition count 206
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 1071 rules in 240 ms. Remains 247 /783 variables (removed 536) and now considering 206/713 (removed 507) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 253 ms. Remains : 247/783 places, 206/713 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3372 ms (no deadlock found). (steps per millisecond=370 )
Random directed walk for 1250009 steps, including 0 resets, run took 2077 ms (no deadlock found). (steps per millisecond=601 )
// Phase 1: matrix 206 rows 247 cols
[2024-05-28 16:32:04] [INFO ] Computed 110 invariants in 17 ms
[2024-05-28 16:32:04] [INFO ] [Real]Absence check using 110 positive place invariants in 42 ms returned sat
[2024-05-28 16:32:04] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-28 16:32:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:32:04] [INFO ] [Nat]Absence check using 110 positive place invariants in 25 ms returned sat
[2024-05-28 16:32:04] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-28 16:32:05] [INFO ] Computed and/alt/rep : 202/319/202 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 16:32:05] [INFO ] Added : 175 causal constraints over 36 iterations in 745 ms. Result :sat
Parikh directed walk for 101200 steps, including 1000 resets, run took 301 ms. (steps per millisecond=336 )
Random directed walk for 500002 steps, including 0 resets, run took 830 ms (no deadlock found). (steps per millisecond=602 )
Random walk for 500000 steps, including 0 resets, run took 1285 ms (no deadlock found). (steps per millisecond=389 )
Random directed walk for 500001 steps, including 0 resets, run took 828 ms (no deadlock found). (steps per millisecond=603 )
Random walk for 500000 steps, including 0 resets, run took 1272 ms (no deadlock found). (steps per millisecond=393 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 247/247 places, 206/206 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 9 ms. Remains 247 /247 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-28 16:32:10] [INFO ] Invariant cache hit.
[2024-05-28 16:32:10] [INFO ] Implicit Places using invariants in 150 ms returned [230, 234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 245/247 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 204
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 4 rules in 12 ms. Remains 243 /245 variables (removed 2) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 243 cols
[2024-05-28 16:32:10] [INFO ] Computed 108 invariants in 1 ms
[2024-05-28 16:32:10] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-28 16:32:10] [INFO ] Invariant cache hit.
[2024-05-28 16:32:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 243/247 places, 204/206 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 472 ms. Remains : 243/247 places, 204/206 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3167 ms (no deadlock found). (steps per millisecond=394 )
Random directed walk for 1250000 steps, including 0 resets, run took 2080 ms (no deadlock found). (steps per millisecond=600 )
[2024-05-28 16:32:15] [INFO ] Invariant cache hit.
[2024-05-28 16:32:16] [INFO ] [Real]Absence check using 108 positive place invariants in 20 ms returned sat
[2024-05-28 16:32:16] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-28 16:32:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:32:16] [INFO ] [Nat]Absence check using 108 positive place invariants in 21 ms returned sat
[2024-05-28 16:32:16] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-28 16:32:16] [INFO ] Computed and/alt/rep : 200/313/200 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-28 16:32:16] [INFO ] Added : 166 causal constraints over 34 iterations in 616 ms. Result :sat
Parikh directed walk for 84900 steps, including 201 resets, run took 273 ms. (steps per millisecond=310 )
Random directed walk for 500001 steps, including 0 resets, run took 819 ms (no deadlock found). (steps per millisecond=610 )
Random walk for 500000 steps, including 0 resets, run took 1250 ms (no deadlock found). (steps per millisecond=400 )
Random directed walk for 500002 steps, including 0 resets, run took 818 ms (no deadlock found). (steps per millisecond=611 )
Random walk for 500000 steps, including 0 resets, run took 1257 ms (no deadlock found). (steps per millisecond=397 )
[2024-05-28 16:32:21] [INFO ] Flatten gal took : 77 ms
[2024-05-28 16:32:21] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2024-05-28 16:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 783 places, 713 transitions and 1786 arcs took 7 ms.
Total runtime 23348 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-010B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 783
TRANSITIONS: 713
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


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


----------------------------------------------------------------------
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: 529
MODEL NAME: /home/mcc/execution/410/model
783 places, 713 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//
++ 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 ReachabilityDeadlock -timeout 180 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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 r364-tall-171683777800386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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