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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12832.979 1369674.00 2202598.00 3952.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-171654416300281.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-005000, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416300281
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.3K Apr 13 19:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 19:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 13:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 13:59 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 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 14 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 14 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 13 22:55 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 227K 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 1716832907323

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-005000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 18:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-05-27 18:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 18:01:49] [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:01:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 18:01:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1567 ms
[2024-05-27 18:01:51] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25000 PT places and 25000.0 transition bindings in 29 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 18:01:51] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-27 18:01:51] [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) 5000) 5000) 5000)]] contains successor/predecessor on variables of sort Philo
[2024-05-27 18:01:51] [INFO ] Unfolded HLPN to a Petri net with 25000 places and 25000 transitions 80000 arcs in 458 ms.
[2024-05-27 18:01:51] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 54 ms.55611KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 10 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
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 10000 rules in 10907 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 10935 ms. Remains : 20000/25000 places, 20000/25000 transitions.
Interrupted Random walk after 42920 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
// Phase 1: matrix 20000 rows 20000 cols
[2024-05-27 18:02:33] [INFO ] Computed 10000 invariants in 144 ms
[2024-05-27 18:07:33] [INFO ] [Real]Absence check using 10000 positive place invariants in 241727 ms returned unknown
Interrupted Random directed walk after 19992 steps, including 0 resets, run timeout after 33611 ms. (steps per millisecond=0 )
Interrupted Random walk after 47284 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Interrupted Random directed walk after 20000 steps, including 0 resets, run timeout after 32577 ms. (steps per millisecond=0 )
Interrupted Random walk after 44890 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 20000/20000 places, 20000/20000 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 2169 ms. Remains 20000 /20000 variables (removed 0) and now considering 20000/20000 (removed 0) transitions.
[2024-05-27 18:09:42] [INFO ] Invariant cache hit.
[2024-05-27 18:10:23] [INFO ] Performed 11241/20000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 18:10:49] [INFO ] Implicit Places using invariants in 67269 ms returned []
Implicit Place search using SMT only with invariants took 67287 ms to find 0 implicit places.
Running 10000 sub problems to find dead transitions.
[2024-05-27 18:10:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30392 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 10000/10000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30253 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 0/10000 constraints, Known Traps: 0/0 constraints]
After SMT, in 79277ms problems are : Problem set: 0 solved, 10000 unsolved
Search for dead transitions found 0 dead transitions in 79672ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 149213 ms. Remains : 20000/20000 places, 20000/20000 transitions.
Interrupted Random walk after 43433 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
[2024-05-27 18:12:39] [INFO ] Invariant cache hit.
[2024-05-27 18:17:39] [INFO ] [Real]Absence check using 10000 positive place invariants in 236134 ms returned unknown
Interrupted Random directed walk after 19996 steps, including 0 resets, run timeout after 32174 ms. (steps per millisecond=0 )
Interrupted Random walk after 45550 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
Interrupted Random directed walk after 19997 steps, including 0 resets, run timeout after 31843 ms. (steps per millisecond=0 )
Interrupted Random walk after 45119 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=1 )
[2024-05-27 18:19:45] [INFO ] Flatten gal took : 1900 ms
[2024-05-27 18:19:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 4 ms.
[2024-05-27 18:19:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25000 places, 25000 transitions and 80000 arcs took 222 ms.
Total runtime 1076264 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-005000

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 557
MODEL NAME: /home/mcc/execution/411/model
25000 places, 25000 transitions.

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

BK_STOP 1716834276997

--------------------
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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-005000"
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-005000, 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-171654416300281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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