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

About the Execution of GreatSPN+red for MAPK-PT-10240

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
595.151 46115.00 100051.00 139.80 FFFFFFFTTFFFTFTT 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.r223-tall-171649611600494.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 MAPK-PT-10240, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611600494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-10240-ReachabilityCardinality-2024-00
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-01
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-02
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-03
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-04
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-05
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-06
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-07
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-08
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-09
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-10
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-11
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-12
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-13
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-14
FORMULA_NAME MAPK-PT-10240-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716564437016

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-10240
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:27:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 15:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:27:18] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-24 15:27:18] [INFO ] Transformed 22 places.
[2024-05-24 15:27:18] [INFO ] Transformed 30 transitions.
[2024-05-24 15:27:18] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 133 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 40984 steps (8 resets) in 220 ms. (185 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 154 ms. (25 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 195 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 142 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 200089 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 16
Probabilistic random walk after 200089 steps, saw 132797 distinct states, run finished after 3009 ms. (steps per millisecond=66 ) properties seen :0
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 15:27:21] [INFO ] Computed 7 invariants in 10 ms
Problem MAPK-PT-10240-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MAPK-PT-10240-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MAPK-PT-10240-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem MAPK-PT-10240-ReachabilityCardinality-2024-07 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MAPK-PT-10240-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem MAPK-PT-10240-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 6 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 6 solved, 10 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 10/39 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 39 constraints, problems are : Problem set: 6 solved, 10 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 10/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 6 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 30003 ms.
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 22/22 places, 30/30 transitions.
RANDOM walk for 40984 steps (8 resets) in 167 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 319576 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 4
Probabilistic random walk after 319576 steps, saw 210638 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-24 15:27:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 0 solved, 4 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 4 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 51080 steps, including 0 resets, run visited all 1 properties in 66 ms. (steps per millisecond=773 )
FORMULA MAPK-PT-10240-ReachabilityCardinality-2024-09 FALSE 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 4 properties in 6865 ms.
All properties solved without resorting to model-checking.
Total runtime 44901 ms.
ITS solved all properties within timeout

BK_STOP 1716564483131

--------------------
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="MAPK-PT-10240"
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 MAPK-PT-10240, 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 r223-tall-171649611600494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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