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

About the Execution of GreatSPN+red for CSRepetitions-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
219.376 2571.00 4002.00 25.40 2 2 2 2 4 4 2 2 4 4 4 2 4 2 2 2 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.r069-tall-171620504000181.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 CSRepetitions-COL-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504000181
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.1K Apr 12 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 09:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 09:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 13K May 18 16:42 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 CSRepetitions-COL-02-UpperBounds-00
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-01
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-02
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-03
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-04
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-05
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-06
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-07
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-08
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-09
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-10
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-11
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-12
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-13
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-14
FORMULA_NAME CSRepetitions-COL-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716413331070

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 21:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 21:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:28:52] [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-22 21:28:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 21:28:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 520 ms
[2024-05-22 21:28:52] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 6
[2024-05-22 21:28:52] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-22 21:28:52] [INFO ] Skeletonized 6 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 21:28:52] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 2, 4, 0, 2, 0] Max Struct:[+inf, +inf, 4, 4, 2, 2]
FORMULA CSRepetitions-COL-02-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-02-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-02-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-22 21:28:53] [INFO ] Invariant cache hit.
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-22 21:28:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:28:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:28:53] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 21:28:53] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:28:53] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 21:28:53] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-22 21:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 21:28:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-22 21:28:53] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 21:28:53] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:28:53] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 21:28:53] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 2, 0, 0] Max Struct:[+inf, 2, 4, 2]
FORMULA CSRepetitions-COL-02-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA CSRepetitions-COL-02-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 2
[2024-05-22 21:28:53] [INFO ] Unfolded HLPN to a Petri net with 18 places and 20 transitions 60 arcs in 10 ms.
[2024-05-22 21:28:53] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0] Max Struct:[+inf, 4, 2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, 4, 2]
// Phase 1: matrix 20 rows 18 cols
[2024-05-22 21:28:53] [INFO ] Computed 5 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[+inf, 4, 2]
RANDOM walk for 10000 steps (585 resets) in 37 ms. (263 steps per ms)
FORMULA CSRepetitions-COL-02-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (130 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 21:28:53] [INFO ] Invariant cache hit.
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2024-05-22 21:28:53] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA CSRepetitions-COL-02-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CSRepetitions-COL-02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided 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 1335 ms.
ITS solved all properties within timeout

BK_STOP 1716413333641

--------------------
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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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 r069-tall-171620504000181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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