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

About the Execution of GreatSPN+red for Philosophers-COL-000500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15113.939 393395.00 870208.00 645.30 FTTFFFTFFFTFFFFT 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.r267-smll-171654406400431.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 Philosophers-COL-000500, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406400431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.4K Apr 13 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 09:16 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 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 31K 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 Philosophers-COL-000500-ReachabilityFireability-2024-00
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-01
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-02
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-03
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-04
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-05
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-06
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-07
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-08
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-09
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-10
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-11
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-12
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-13
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-14
FORMULA_NAME Philosophers-COL-000500-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716873437861

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:17:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:17:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:17:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 05:17:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 05:17:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1270 ms
[2024-05-28 05:17:21] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 36 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 46 ms.
Reduction of identical properties reduced properties to check from 16 to 12
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:17:21] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-28 05:17:21] [INFO ] Skeletonized 10 HLPN properties in 1 ms.
All 10 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2024-05-28 05:17:21] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 158 ms.
[2024-05-28 05:17:21] [INFO ] Unfolded 10 HLPN properties in 9 ms.
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6004 ms. (6 steps per ms) remains 9/9 properties
BEST_FIRST walk for 34965 steps (8 resets) in 21428 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14814 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4680 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16094 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12867 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 35964 steps (8 resets) in 21054 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 27960 steps (4 resets) in 20557 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4560 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16820 ms. (2 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 748739 steps, run timeout after 105017 ms. (steps per millisecond=7 ) properties seen :0 out of 9
Probabilistic random walk after 748739 steps, saw 745761 distinct states, run finished after 105026 ms. (steps per millisecond=7 ) properties seen :0
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-28 05:19:42] [INFO ] Computed 1000 invariants in 73 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5072 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 35972ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 120 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 2500/2500 places, 2500/2500 transitions.
RANDOM walk for 40000 steps (8 resets) in 3488 ms. (11 steps per ms) remains 9/9 properties
BEST_FIRST walk for 35964 steps (8 resets) in 20863 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12880 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4673 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16196 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12193 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 35964 steps (8 resets) in 21323 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 27960 steps (4 resets) in 20615 ms. (1 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5130 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16939 ms. (2 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 727903 steps, run timeout after 102074 ms. (steps per millisecond=7 ) properties seen :0 out of 9
Probabilistic random walk after 727903 steps, saw 725021 distinct states, run finished after 102075 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-28 05:22:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14658 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 9 unsolved in 20375 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 59550ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 466 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=11 )
FORMULA Philosophers-COL-000500-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 9 properties in 16146 ms.
All properties solved without resorting to model-checking.
Total runtime 391301 ms.
ITS solved all properties within timeout

BK_STOP 1716873831256

--------------------
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="Philosophers-COL-000500"
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 Philosophers-COL-000500, 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 r267-smll-171654406400431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000500.tgz
mv Philosophers-COL-000500 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 ;