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

About the Execution of GreatSPN+red for SmallOperatingSystem-PT-MT4096DC2048

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
332.575 40633.00 89618.00 215.50 TFFTTTFFTTTTTTFT 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-171683810200318.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 SmallOperatingSystem-PT-MT4096DC2048, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683810200318
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 8.1K 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 SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-00
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-01
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-02
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-03
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-04
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-05
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-06
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-07
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-08
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-09
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-10
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-11
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-12
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-13
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-14
FORMULA_NAME SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716984241215

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT4096DC2048
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 12:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 12:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:04:03] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-05-29 12:04:03] [INFO ] Transformed 9 places.
[2024-05-29 12:04:03] [INFO ] Transformed 8 transitions.
[2024-05-29 12:04:03] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 320 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40988 steps (8 resets) in 185 ms. (220 steps per ms) remains 14/16 properties
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 880 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1043 ms. (38 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1003 ms. (39 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 840 ms. (47 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
// Phase 1: matrix 8 rows 9 cols
[2024-05-29 12:04:05] [INFO ] Computed 4 invariants in 7 ms
Problem SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-03 is UNSAT
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-05 is UNSAT
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-06 is UNSAT
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-10 is UNSAT
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/17 variables, and 13 constraints, problems are : Problem set: 4 solved, 10 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 8/17 variables, 9/13 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 10/23 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/17 variables, and 23 constraints, problems are : Problem set: 4 solved, 10 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 10/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 780ms problems are : Problem set: 4 solved, 10 unsolved
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 8 properties in 32272 ms.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 33 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 7/9 places, 7/8 transitions.
RANDOM walk for 40988 steps (8 resets) in 69 ms. (585 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 690632 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 2
Probabilistic random walk after 690632 steps, saw 378694 distinct states, run finished after 3008 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 7 rows 7 cols
[2024-05-29 12:04:41] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/14 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 8192 steps, including 0 resets, run visited all 2 properties in 54 ms. (steps per millisecond=151 )
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA SmallOperatingSystem-PT-MT4096DC2048-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 60 ms.
All properties solved without resorting to model-checking.
Total runtime 38828 ms.
ITS solved all properties within timeout

BK_STOP 1716984281848

--------------------
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="SmallOperatingSystem-PT-MT4096DC2048"
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 SmallOperatingSystem-PT-MT4096DC2048, 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 r377-smll-171683810200318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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