fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838857200406
Last Updated
May 14, 2023

About the Execution of Marcie+red for FamilyReunion-PT-L00020M0002C001P001G001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6416.632 3600000.00 3647696.00 6862.50 FTFTTTTTFTFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857200406.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200406
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 29K Feb 26 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 26 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 26 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 26 11:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Feb 26 11:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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 FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678537479911

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 12:24:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 12:24:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:24:41] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-11 12:24:41] [INFO ] Transformed 3271 places.
[2023-03-11 12:24:41] [INFO ] Transformed 2753 transitions.
[2023-03-11 12:24:41] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 11 places and 0 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 16) seen :5
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2753 rows 3260 cols
[2023-03-11 12:24:43] [INFO ] Computed 748 place invariants in 191 ms
[2023-03-11 12:24:45] [INFO ] After 1642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 12:24:46] [INFO ] [Nat]Absence check using 61 positive place invariants in 67 ms returned sat
[2023-03-11 12:24:46] [INFO ] [Nat]Absence check using 61 positive and 687 generalized place invariants in 192 ms returned sat
[2023-03-11 12:24:50] [INFO ] After 3180ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-11 12:24:51] [INFO ] After 4809ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 1468 ms.
[2023-03-11 12:24:53] [INFO ] After 7932ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 5 different solutions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 540 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=90 )
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 66 ms.
All properties solved without resorting to model-checking.
Total runtime 12044 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: FamilyReunion_PT_L00020M0002C001P001G001
(NrP: 3271 NrTr: 2753 NrArc: 8446)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.793sec

net check time: 0m 0.001sec

init dd package: 0m 2.710sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9731960 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099120 kB

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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
m0_0
m0_1
m0_2
c2_0
c2_1
r0_Y
r0_N
c0_0
c0_1
p0_0
p0_1
found 11 constant places
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.033sec

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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857200406"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-L00020M0002C001P001G001 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;