fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r333-tall-171679078900653
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ServersAndClients-PT-200040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
738.256 40398.00 51960.00 241.50 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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.r333-tall-171679078900653.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 ServersAndClients-PT-200040, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078900653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 16:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.1M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-00
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-01
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-02
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-03
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-04
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-05
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-06
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-07
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-08
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-09
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-10
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-11
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-12
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-13
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-14
FORMULA_NAME ServersAndClients-PT-200040-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716882097296

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-200040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:41:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 07:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:41:38] [INFO ] Load time of PNML (sax parser for PT used): 435 ms
[2024-05-28 07:41:39] [INFO ] Transformed 8841 places.
[2024-05-28 07:41:39] [INFO ] Transformed 16400 transitions.
[2024-05-28 07:41:39] [INFO ] Found NUPN structural information;
[2024-05-28 07:41:39] [INFO ] Parsed PT model containing 8841 places and 16400 transitions and 49600 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16400 rows 8841 cols
[2024-05-28 07:41:39] [INFO ] Computed 441 invariants in 426 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 523 ms. (19 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 417 ms. (191 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-28 07:41:40] [INFO ] Invariant cache hit.
[2024-05-28 07:41:43] [INFO ] [Real]Absence check using 241 positive place invariants in 752 ms returned sat
[2024-05-28 07:41:43] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 160 ms returned sat
[2024-05-28 07:41:45] [INFO ] [Real]Absence check using state equation in 2584 ms returned unknown
[2024-05-28 07:41:47] [INFO ] [Real]Absence check using 241 positive place invariants in 666 ms returned sat
[2024-05-28 07:41:47] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 144 ms returned sat
[2024-05-28 07:41:50] [INFO ] [Real]Absence check using state equation in 2815 ms returned unknown
[2024-05-28 07:41:52] [INFO ] [Real]Absence check using 241 positive place invariants in 727 ms returned sat
[2024-05-28 07:41:53] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 146 ms returned sat
[2024-05-28 07:41:55] [INFO ] [Real]Absence check using state equation in 2756 ms returned unknown
[2024-05-28 07:41:57] [INFO ] [Real]Absence check using 241 positive place invariants in 708 ms returned sat
[2024-05-28 07:41:57] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 141 ms returned sat
[2024-05-28 07:42:00] [INFO ] [Real]Absence check using state equation in 2860 ms returned unknown
[2024-05-28 07:42:02] [INFO ] [Real]Absence check using 241 positive place invariants in 682 ms returned sat
[2024-05-28 07:42:02] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 137 ms returned sat
[2024-05-28 07:42:05] [INFO ] [Real]Absence check using state equation in 2911 ms returned unknown
[2024-05-28 07:42:07] [INFO ] [Real]Absence check using 241 positive place invariants in 629 ms returned sat
[2024-05-28 07:42:07] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 139 ms returned sat
[2024-05-28 07:42:10] [INFO ] [Real]Absence check using state equation in 2955 ms returned unknown
[2024-05-28 07:42:12] [INFO ] [Real]Absence check using 241 positive place invariants in 624 ms returned sat
[2024-05-28 07:42:12] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 145 ms returned sat
[2024-05-28 07:42:15] [INFO ] [Real]Absence check using state equation in 2955 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 8841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8841/8841 places, 16400/16400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7993 transitions
Trivial Post-agglo rules discarded 7993 transitions
Performed 7993 trivial Post agglomeration. Transition count delta: 7993
Iterating post reduction 0 with 7993 rules applied. Total rules applied 7993 place count 8841 transition count 8407
Reduce places removed 8026 places and 0 transitions.
Ensure Unique test removed 6400 transitions
Reduce isomorphic transitions removed 6400 transitions.
Iterating post reduction 1 with 14426 rules applied. Total rules applied 22419 place count 815 transition count 2007
Drop transitions (Redundant composition of simpler transitions.) removed 1393 transitions
Redundant transition composition rules discarded 1393 transitions
Iterating global reduction 2 with 1393 rules applied. Total rules applied 23812 place count 815 transition count 614
Discarding 193 places :
Implicit places reduction removed 193 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 386 transitions
Trivial Post-agglo rules discarded 386 transitions
Performed 386 trivial Post agglomeration. Transition count delta: 386
Iterating post reduction 2 with 579 rules applied. Total rules applied 24391 place count 622 transition count 228
Reduce places removed 579 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Iterating post reduction 3 with 772 rules applied. Total rules applied 25163 place count 43 transition count 35
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 25170 place count 43 transition count 35
Applied a total of 25170 rules in 323 ms. Remains 43 /8841 variables (removed 8798) and now considering 35/16400 (removed 16365) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 43/8841 places, 35/16400 transitions.
// Phase 1: matrix 35 rows 43 cols
[2024-05-28 07:42:16] [INFO ] Computed 22 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 930 ms. (1074 steps per ms)
FORMULA ServersAndClients-PT-200040-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ServersAndClients-PT-200040-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 428 ms. (2331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 39203 ms.
ITS solved all properties within timeout

BK_STOP 1716882137694

--------------------
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 UpperBounds -timeout 360 -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="ServersAndClients-PT-200040"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 ServersAndClients-PT-200040, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078900653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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