fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r276-smll-171654416400286
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Philosophers-COL-010000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13369.012 1749951.00 2535612.00 5026.40 [undef] Cannot compute

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.r276-smll-171654416400286.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 Philosophers-COL-010000, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416400286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.9K Apr 14 06:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 14 06:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 14 00:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 14 00:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 14 22:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 14 22:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 14 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 14 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 447K 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 1716834713154

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Philosophers-COL-010000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 18:31:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-27 18:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:31:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 18:31:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 18:31:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1678 ms
[2024-05-27 18:31:57] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50000 PT places and 50000.0 transition bindings in 35 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 18:31:57] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 8 ms.
[2024-05-27 18:31:57] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10000) 10000) 10000)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 18:31:57] [INFO ] Unfolded HLPN to a Petri net with 50000 places and 50000 transitions 160000 arcs in 492 ms.
[2024-05-27 18:31:57] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 68 ms.98280KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 50000/50000 places, 50000/50000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10000 Post agglomeration using F-continuation condition.Transition count delta: 10000
Deduced a syphon composed of 10000 places in 19 ms
Reduce places removed 10000 places and 0 transitions.
Iterating global reduction 0 with 20000 rules applied. Total rules applied 20000 place count 40000 transition count 40000
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 20000 rules in 16166 ms. Remains 40000 /50000 variables (removed 10000) and now considering 40000/50000 (removed 10000) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 16195 ms. Remains : 40000/50000 places, 40000/50000 transitions.
Interrupted Random walk after 8896 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 )
// Phase 1: matrix 40000 rows 40000 cols
[2024-05-27 18:32:44] [INFO ] Computed 20000 invariants in 480 ms
[2024-05-27 18:37:45] [INFO ] [Real]Absence check using 20000 positive place invariants in 58239 ms returned unknown
Interrupted Random directed walk after 20001 steps, including 0 resets, run timeout after 77978 ms. (steps per millisecond=0 )
Interrupted Random walk after 7877 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 20001 steps, including 0 resets, run timeout after 77533 ms. (steps per millisecond=0 )
Interrupted Random walk after 8661 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 40000/40000 places, 40000/40000 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 510 ms. Remains 40000 /40000 variables (removed 0) and now considering 40000/40000 (removed 0) transitions.
[2024-05-27 18:41:21] [INFO ] Invariant cache hit.
[2024-05-27 18:42:23] [INFO ] Performed 4751/40000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 18:42:53] [INFO ] Performed 9502/40000 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-27 18:43:23] [INFO ] Performed 14298/40000 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-27 18:43:53] [INFO ] Performed 19166/40000 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-27 18:43:53] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-27 18:43:53] [INFO ] Implicit Places using invariants in 152093 ms returned []
Implicit Place search using SMT only with invariants took 152110 ms to find 0 implicit places.
Running 20000 sub problems to find dead transitions.
[2024-05-27 18:43:54] [INFO ] Invariant cache hit.
SMT process timed out in 111020ms, After SMT, problems are : Problem set: 0 solved, 20000 unsolved
Search for dead transitions found 0 dead transitions in 111572ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 264337 ms. Remains : 40000/40000 places, 40000/40000 transitions.
Interrupted Random walk after 6281 steps, including 0 resets, run timeout after 30004 ms. (steps per millisecond=0 )
[2024-05-27 18:46:15] [INFO ] Invariant cache hit.
[2024-05-27 18:51:15] [INFO ] [Real]Absence check using 20000 positive place invariants in 49863 ms returned unknown
Interrupted Random directed walk after 20001 steps, including 0 resets, run timeout after 77627 ms. (steps per millisecond=0 )
Interrupted Random walk after 8515 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 20001 steps, including 0 resets, run timeout after 78566 ms. (steps per millisecond=0 )
Interrupted Random walk after 8457 steps, including 0 resets, run timeout after 30002 ms. (steps per millisecond=0 )
[2024-05-27 18:54:54] [INFO ] Flatten gal took : 2619 ms
[2024-05-27 18:54:54] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 2 ms.
[2024-05-27 18:54:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50000 places, 50000 transitions and 160000 arcs took 214 ms.
Total runtime 1379821 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-010000

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 566
MODEL NAME: /home/mcc/execution/413/model
50000 places, 50000 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716836463105

--------------------
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
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
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="Philosophers-COL-010000"
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 Philosophers-COL-010000, 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 r276-smll-171654416400286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-010000.tgz
mv Philosophers-COL-010000 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 ;