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

About the Execution of GreatSPN+red for Diffusion2D-PT-D20N150

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
540.052 28864.00 58295.00 102.20 FFTFTFFFFTTTFTTT 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-171631130700262.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 Diffusion2D-PT-D20N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631130700262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 11 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:40 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 1.2M 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 Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-00
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-01
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-02
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-03
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-04
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-05
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-06
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-07
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-08
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-09
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-10
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-11
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-12
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-13
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-14
FORMULA_NAME Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716347613118

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N150
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:13:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 03:13:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:13:34] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-22 03:13:34] [INFO ] Transformed 400 places.
[2024-05-22 03:13:34] [INFO ] Transformed 2964 transitions.
[2024-05-22 03:13:34] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40486 steps (8 resets) in 257 ms. (156 steps per ms) remains 14/16 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 568 ms. (70 steps per ms) remains 13/14 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 12/13 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 763 ms. (52 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 11/12 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 10/11 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 10/10 properties
// Phase 1: matrix 2964 rows 400 cols
[2024-05-22 03:13:35] [INFO ] Computed 1 invariants in 43 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-10 is UNSAT
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 176/400 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2964/3364 variables, 400/401 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3364 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/3364 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3364/3364 variables, and 401 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 190/400 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2964/3364 variables, 400/401 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3364 variables, 9/410 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3364 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/3364 variables, 0/410 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
After SMT solving in domain Int declared 3364/3364 variables, and 410 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 7557ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 18384 ms.
Support contains 91 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 2964/2964 transitions.
Graph (trivial) has 1768 edges and 400 vertex of which 309 / 400 are part of one of the 1 SCC in 6 ms
Free SCC test removed 308 places
Drop transitions (Empty/Sink Transition effects.) removed 1768 transitions
Ensure Unique test removed 854 transitions
Reduce isomorphic transitions removed 2622 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 0 with 168 rules applied. Total rules applied 169 place count 92 transition count 174
Applied a total of 169 rules in 49 ms. Remains 92 /400 variables (removed 308) and now considering 174/2964 (removed 2790) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 92/400 places, 174/2964 transitions.
RANDOM walk for 40489 steps (8 resets) in 54 ms. (736 steps per ms) remains 2/3 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/2 properties
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 174 rows 92 cols
[2024-05-22 03:14:01] [INFO ] Computed 1 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 174/266 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 174/266 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 283 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=283 )
FORMULA Diffusion2D-PT-D20N150-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
All properties solved without resorting to model-checking.
Total runtime 27716 ms.
ITS solved all properties within timeout

BK_STOP 1716347641982

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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="Diffusion2D-PT-D20N150"
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 Diffusion2D-PT-D20N150, 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-171631130700262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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