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

About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
289.911 7332.00 18925.00 158.50 FFFFFFTTFFFFTFTT 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.r377-smll-171683809500007.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 SieveSingleMsgMbox-PT-d0m04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809500007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K 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 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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

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

=== Now, execution of the tool begins

BK_START 1716876474210

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:07:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:07:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:07:57] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-28 06:07:57] [INFO ] Transformed 262 places.
[2024-05-28 06:07:57] [INFO ] Transformed 73 transitions.
[2024-05-28 06:07:57] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 190 places in 5 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8998 resets) in 2754 ms. (14 steps per ms) remains 6/7 properties
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (4148 resets) in 308 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3084 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (5000 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1707 resets) in 765 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1903 resets) in 604 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1906 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
// Phase 1: matrix 73 rows 72 cols
[2024-05-28 06:07:58] [INFO ] Computed 6 invariants in 12 ms
[2024-05-28 06:07:59] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-08 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 20/61 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 06:07:59] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 73/145 variables, 72/79 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 31/110 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/110 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/110 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 110 constraints, problems are : Problem set: 3 solved, 3 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/55 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 06:07:59] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 17/72 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 06:08:00] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-28 06:08:00] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 73/145 variables, 72/82 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 31/113 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 3/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 116 constraints, problems are : Problem set: 3 solved, 3 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 72/72 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1647ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 480 ms.
Support contains 19 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 63 transition count 66
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 63 transition count 66
Applied a total of 15 rules in 37 ms. Remains 63 /72 variables (removed 9) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 63/72 places, 66/73 transitions.
RANDOM walk for 40000 steps (8952 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4093 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1900 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1872 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Probably explored full state space saw : 670 states, properties seen :2
Probabilistic random walk after 1605 steps, saw 670 distinct states, run finished after 32 ms. (steps per millisecond=50 ) properties seen :2
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Explored full state space saw : 670 states, properties seen :0
Exhaustive walk after 1605 steps, saw 670 distinct states, run finished after 5 ms. (steps per millisecond=321 ) properties seen :0
FORMULA SieveSingleMsgMbox-PT-d0m04-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 4746 ms.
ITS solved all properties within timeout

BK_STOP 1716876481542

--------------------
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 ReachabilityFireability -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="SieveSingleMsgMbox-PT-d0m04"
export BK_EXAMINATION="ReachabilityFireability"
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 SieveSingleMsgMbox-PT-d0m04, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809500007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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