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

About the Execution of GreatSPN+red for QuasiCertifProtocol-COL-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2809.703 36332.00 69601.00 125.30 FTTTTFTTTFFFTFTF 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-171662335700047.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 QuasiCertifProtocol-COL-28, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 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 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K 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 QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716651522116

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:38:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:38:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:38:43] [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-25 15:38:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 15:38:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 578 ms
[2024-05-25 15:38:43] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
[2024-05-25 15:38:43] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 15:38:43] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
RANDOM walk for 40013 steps (1005 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (279 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 320 steps, run visited all 1 properties in 12 ms. (steps per millisecond=26 )
Probabilistic random walk after 320 steps, saw 257 distinct states, run finished after 16 ms. (steps per millisecond=20 ) properties seen :1
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-25 15:38:44] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:38:44] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-05-25 15:38:44] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 35 ms.
[2024-05-25 15:38:44] [INFO ] Unfolded 15 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (1211 resets) in 2708 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1015 ms. (3 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 362 ms. (11 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 284 ms. (14 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 349 ms. (11 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 293 ms. (13 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 243 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 520 ms. (7 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 354 ms. (11 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 321758 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :10 out of 15
Probabilistic random walk after 321758 steps, saw 61048 distinct states, run finished after 3006 ms. (steps per millisecond=107 ) properties seen :10
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 446 rows 2998 cols
[2024-05-25 15:38:49] [INFO ] Computed 2553 invariants in 97 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2936 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2936 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-10 is UNSAT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 62/2998 variables, 4/1712 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2998/3444 variables, and 2553 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2936 variables, 1708/1708 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2936 variables, 0/1708 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 62/2998 variables, 4/1712 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2998/3444 variables, and 2553 constraints, problems are : Problem set: 2 solved, 3 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 0/2998 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 13242ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2936 out of 2998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2936 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.19 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 77 ms. Remains 2936 /2998 variables (removed 62) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2936/2998 places, 446/446 transitions.
RANDOM walk for 40000 steps (1209 resets) in 533 ms. (74 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 6608 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 3634 ms. (11 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 682647 steps, run timeout after 6001 ms. (steps per millisecond=113 ) properties seen :0 out of 3
Probabilistic random walk after 682647 steps, saw 106366 distinct states, run finished after 6001 ms. (steps per millisecond=113 ) properties seen :0
// Phase 1: matrix 446 rows 2936 cols
[2024-05-25 15:39:11] [INFO ] Computed 2492 invariants in 123 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2936 variables, 2492/2492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2936 variables, 0/2492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-COL-28-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 3382/3382 variables, and 5428 constraints, problems are : Problem set: 3 solved, 0 unsolved in 4156 ms.
Refiners :[Generalized P Invariants (flows): 2492/2492 constraints, State Equation: 2936/2936 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 6883ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 35180 ms.
ITS solved all properties within timeout

BK_STOP 1716651558448

--------------------
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="QuasiCertifProtocol-COL-28"
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 QuasiCertifProtocol-COL-28, 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-171662335700047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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