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

About the Execution of GreatSPN+red for DrinkVendingMachine-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
239.640 3121.00 8640.00 22.70 TFFFTFFFTTFTFFFT 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.r135-tall-171631131700710.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 DrinkVendingMachine-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131700710
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.1K Apr 12 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 12 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.5K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 23:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 51K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716402181156

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DrinkVendingMachine-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 18:23:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 18:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:23:02] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-22 18:23:02] [INFO ] Transformed 24 places.
[2024-05-22 18:23:02] [INFO ] Transformed 72 transitions.
[2024-05-22 18:23:02] [INFO ] Parsed PT model containing 24 places and 72 transitions and 440 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1945 ms. (20 steps per ms) remains 8/13 properties
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 279 ms. (142 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 8/8 properties
// Phase 1: matrix 52 rows 24 cols
[2024-05-22 18:23:03] [INFO ] Computed 12 invariants in 6 ms
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-00 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-01 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-03 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-06 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-07 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-08 is UNSAT
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 12/12 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 52/76 variables, 24/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/76 variables, 0/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 36 constraints, problems are : Problem set: 6 solved, 2 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/20 variables, 8/10 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/70 variables, 20/30 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/76 variables, 4/34 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 2/36 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 2/38 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/76 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 38 constraints, problems are : Problem set: 6 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 2/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 6 solved, 2 unsolved
Parikh walk visited 0 properties in 104 ms.
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 52/52 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 24 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 26
Reduce places removed 1 places and 2 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 19 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 11 rules in 20 ms. Remains 19 /24 variables (removed 5) and now considering 20/52 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 19/24 places, 20/52 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Probably explored full state space saw : 256 states, properties seen :0
Probabilistic random walk after 2048 steps, saw 256 distinct states, run finished after 16 ms. (steps per millisecond=128 ) properties seen :0
Explored full state space saw : 256 states, properties seen :0
Exhaustive walk after 2048 steps, saw 256 distinct states, run finished after 3 ms. (steps per millisecond=682 ) properties seen :0
FORMULA DrinkVendingMachine-PT-02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 1942 ms.
ITS solved all properties within timeout

BK_STOP 1716402184277

--------------------
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 ReachabilityCardinality -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="DrinkVendingMachine-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
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 DrinkVendingMachine-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131700710"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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