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

About the Execution of GreatSPN+red for Referendum-PT-1000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2665.628 21902.00 63065.00 90.60 FFFTTFTFTFFTTTTF 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.r311-tall-171662337000639.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 Referendum-PT-1000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662337000639
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 40M
-rw-r--r-- 1 mcc users 1.4M Apr 11 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.1M Apr 11 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 430K Apr 11 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 429K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7M Apr 11 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13M Apr 11 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 8.0M Apr 11 19:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 83K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Referendum-PT-1000-ReachabilityFireability-2024-00
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-01
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-02
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-03
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-04
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-05
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-06
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-07
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-08
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-09
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-10
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-11
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-12
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-13
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-14
FORMULA_NAME Referendum-PT-1000-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716764065244

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:54:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 22:54:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:54:26] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-05-26 22:54:26] [INFO ] Transformed 3001 places.
[2024-05-26 22:54:26] [INFO ] Transformed 2001 transitions.
[2024-05-26 22:54:26] [INFO ] Found NUPN structural information;
[2024-05-26 22:54:26] [INFO ] Parsed PT model containing 3001 places and 2001 transitions and 5001 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 358 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (36 resets) in 6405 ms. (6 steps per ms) remains 6/11 properties
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 8064 ms. (4 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4179 ms. (9 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7351 ms. (5 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7436 ms. (5 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 859 ms. (46 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1435 ms. (27 steps per ms) remains 6/6 properties
// Phase 1: matrix 2001 rows 3001 cols
[2024-05-26 22:54:36] [INFO ] Computed 1000 invariants in 35 ms
Problem Referendum-PT-1000-ReachabilityFireability-2024-00 is UNSAT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 1001/1001 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 0/1001 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem Referendum-PT-1000-ReachabilityFireability-2024-01 is UNSAT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2000/3001 variables, 1000/2001 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3001 variables, 2000/4001 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3001 variables, 0/4001 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2001/5002 variables, 3001/7002 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5002 variables, 0/7002 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/5002 variables, 0/7002 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5002/5002 variables, and 7002 constraints, problems are : Problem set: 2 solved, 4 unsolved in 4358 ms.
Refiners :[Domain max(s): 3001/3001 constraints, Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 3001/3001 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
Problem Referendum-PT-1000-ReachabilityFireability-2024-04 is UNSAT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem Referendum-PT-1000-ReachabilityFireability-2024-11 is UNSAT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 1001/1001 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1001 variables, 0/1001 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem Referendum-PT-1000-ReachabilityFireability-2024-03 is UNSAT
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2000/3001 variables, 1000/2001 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3001 variables, 2000/4001 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3001 variables, 0/4001 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2001/5002 variables, 3001/7002 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5002/5002 variables, and 7003 constraints, problems are : Problem set: 5 solved, 1 unsolved in 2448 ms.
Refiners :[Domain max(s): 3001/3001 constraints, Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 3001/3001 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 3001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Graph (complete) has 3000 edges and 3001 vertex of which 35 are kept as prefixes of interest. Removing 2966 places using SCC suffix rule.4 ms
Discarding 2966 places :
Also discarding 1932 output transitions
Drop transitions (Output transitions of discarded places.) removed 1932 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 35 transition count 35
Applied a total of 35 rules in 43 ms. Remains 35 /3001 variables (removed 2966) and now considering 35/2001 (removed 1966) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 35/3001 places, 35/2001 transitions.
RANDOM walk for 40000 steps (1108 resets) in 639 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1120 steps (0 resets) in 7 ms. (140 steps per ms) remains 0/1 properties
FORMULA Referendum-PT-1000-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 20649 ms.
ITS solved all properties within timeout

BK_STOP 1716764087146

--------------------
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 ReachabilityFireability -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="Referendum-PT-1000"
export BK_EXAMINATION="ReachabilityFireability"
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 Referendum-PT-1000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662337000639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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