fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397900295
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V80P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16184.779 3600000.00 13659395.00 375.60 FTFTFTFT?T??TT?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397900295.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V80P20N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397900295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 21K Apr 13 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 687K Apr 13 02:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 13 02:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 562K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 13 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 850K Apr 13 05:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Apr 13 05:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.1M 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 BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716291248611

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:34:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 11:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:34:10] [INFO ] Load time of PNML (sax parser for PT used): 623 ms
[2024-05-21 11:34:10] [INFO ] Transformed 228 places.
[2024-05-21 11:34:10] [INFO ] Transformed 8588 transitions.
[2024-05-21 11:34:10] [INFO ] Parsed PT model containing 228 places and 8588 transitions and 67470 arcs in 875 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 148 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (56 resets) in 4793 ms. (8 steps per ms) remains 9/14 properties
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (24 resets) in 1103 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (17 resets) in 641 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1967 ms. (20 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 655 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 654 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 557 ms. (71 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (20 resets) in 1032 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 576 ms. (69 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (19 resets) in 744 ms. (53 steps per ms) remains 9/9 properties
[2024-05-21 11:34:15] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 228 cols
[2024-05-21 11:34:15] [INFO ] Computed 7 invariants in 34 ms
[2024-05-21 11:34:15] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 81/225 variables, 5/6 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/228 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 530/758 variables, 228/235 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/758 variables, 102/337 constraints. Problems are: Problem set: 4 solved, 5 unsolved
[2024-05-21 11:34:18] [INFO ] Deduced a trap composed of 5 places in 1013 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/758 variables, 1/338 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/758 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/758 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 758/758 variables, and 338 constraints, problems are : Problem set: 4 solved, 5 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 127/225 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 1/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/228 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 530/758 variables, 228/236 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/758 variables, 102/338 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/758 variables, 5/343 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 758/758 variables, and 343 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 228/228 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 10591ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 2202 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Applied a total of 3 rules in 3944 ms. Remains 225 /228 variables (removed 3) and now considering 8587/8588 (removed 1) transitions.
Running 8584 sub problems to find dead transitions.
[2024-05-21 11:34:30] [INFO ] Flow matrix only has 529 transitions (discarded 8058 similar events)
// Phase 1: matrix 529 rows 225 cols
[2024-05-21 11:34:30] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 11:34:30] [INFO ] State equation strengthened by 102 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P20N50

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 228
TRANSITIONS: 8588
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.297s, Sys 0.021s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.053s, Sys 0.009s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 575
MODEL NAME: /home/mcc/execution/model
228 places, 8588 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N50-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="BridgeAndVehicles-PT-V80P20N50"
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 BridgeAndVehicles-PT-V80P20N50, 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 r047-tajo-171620397900295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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