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

About the Execution of GreatSPN+red for ClientsAndServers-PT-N1000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
530.903 46885.00 107110.00 166.50 TTFFTTTTTTFFFFTT 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-171620504700518.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 ClientsAndServers-PT-N1000P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504700518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.1K 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 ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716457422162

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N1000P0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 09:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 09:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 09:43:43] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-05-23 09:43:43] [INFO ] Transformed 25 places.
[2024-05-23 09:43:43] [INFO ] Transformed 18 transitions.
[2024-05-23 09:43:43] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 64016 steps (8 resets) in 174 ms. (365 steps per ms) remains 14/16 properties
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1057 ms. (37 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 477 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 578 ms. (69 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 886 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 14/14 properties
// Phase 1: matrix 18 rows 25 cols
[2024-05-23 09:43:44] [INFO ] Computed 8 invariants in 8 ms
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-10 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-13 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 11 unsolved
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-03 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-09 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 6 solved, 8 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 8/41 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/41 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 41 constraints, problems are : Problem set: 6 solved, 8 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 8/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 6 solved, 8 unsolved
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 33486 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 25/25 places, 18/18 transitions.
RANDOM walk for 64016 steps (8 resets) in 121 ms. (524 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 869176 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :1 out of 3
Probabilistic random walk after 869176 steps, saw 443293 distinct states, run finished after 3006 ms. (steps per millisecond=289 ) properties seen :1
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-23 09:44:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 2 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 35 constraints, problems are : Problem set: 0 solved, 2 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 53704 steps, including 0 resets, run visited all 1 properties in 79 ms. (steps per millisecond=679 )
FORMULA ClientsAndServers-PT-N1000P0-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 6393 ms.
All properties solved without resorting to model-checking.
Total runtime 45645 ms.
ITS solved all properties within timeout

BK_STOP 1716457469047

--------------------
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="ClientsAndServers-PT-N1000P0"
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 ClientsAndServers-PT-N1000P0, 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 r069-tall-171620504700518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 ;