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.r234-tall-167856420400535.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 LeafsetExtension-PT-S64C3, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420400535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C3-ReachabilityFireability-00
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-01
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-02
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-03
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-04
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-05
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-06
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-07
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-08
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-09
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-10
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-11
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-12
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-13
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-14
FORMULA_NAME LeafsetExtension-PT-S64C3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679528675248

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 23:44:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 23:44:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 23:44:37] [INFO ] Load time of PNML (sax parser for PT used): 507 ms
[2023-03-22 23:44:37] [INFO ] Transformed 21462 places.
[2023-03-22 23:44:37] [INFO ] Transformed 21129 transitions.
[2023-03-22 23:44:37] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 662 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 387 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 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 6 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-22 23:44:41] [INFO ] Computed 333 place invariants in 2549 ms
[2023-03-22 23:44:46] [INFO ] [Real]Absence check using 67 positive place invariants in 67 ms returned sat
[2023-03-22 23:44:47] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 834 ms returned sat
[2023-03-22 23:45:06] [INFO ] After 17658ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:6
[2023-03-22 23:45:06] [INFO ] After 17688ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 23:45:06] [INFO ] After 25111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:6
[2023-03-22 23:45:11] [INFO ] [Nat]Absence check using 67 positive place invariants in 53 ms returned sat
[2023-03-22 23:45:12] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 814 ms returned sat
[2023-03-22 23:45:31] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 137 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 17231 are kept as prefixes of interest. Removing 4231 places using SCC suffix rule.42 ms
Discarding 4231 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 6817 transitions
Trivial Post-agglo rules discarded 6817 transitions
Performed 6817 trivial Post agglomeration. Transition count delta: 6817
Iterating post reduction 0 with 6817 rules applied. Total rules applied 6818 place count 17231 transition count 14310
Reduce places removed 6817 places and 0 transitions.
Performed 1379 Post agglomeration using F-continuation condition.Transition count delta: 1379
Iterating post reduction 1 with 8196 rules applied. Total rules applied 15014 place count 10414 transition count 12931
Reduce places removed 1379 places and 0 transitions.
Iterating post reduction 2 with 1379 rules applied. Total rules applied 16393 place count 9035 transition count 12931
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 16393 place count 9035 transition count 12816
Deduced a syphon composed of 115 places in 6 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 16623 place count 8920 transition count 12816
Discarding 3993 places :
Symmetric choice reduction at 3 with 3993 rule applications. Total rules 20616 place count 4927 transition count 8823
Iterating global reduction 3 with 3993 rules applied. Total rules applied 24609 place count 4927 transition count 8823
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 24670 place count 4866 transition count 8762
Iterating global reduction 3 with 61 rules applied. Total rules applied 24731 place count 4866 transition count 8762
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 24732 place count 4865 transition count 8762
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24734 place count 4864 transition count 8761
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 24744 place count 4864 transition count 8751
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 24754 place count 4854 transition count 8751
Partial Free-agglomeration rule applied 163 times.
Drop transitions removed 163 transitions
Iterating global reduction 5 with 163 rules applied. Total rules applied 24917 place count 4854 transition count 8751
Applied a total of 24917 rules in 6165 ms. Remains 4854 /21462 variables (removed 16608) and now considering 8751/21129 (removed 12378) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6167 ms. Remains : 4854/21462 places, 8751/21129 transitions.
Incomplete random walk after 10000 steps, including 686 resets, run finished after 369 ms. (steps per millisecond=27 ) properties (out of 10) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 8751 rows 4854 cols
[2023-03-22 23:45:38] [INFO ] Computed 197 place invariants in 124 ms
[2023-03-22 23:45:39] [INFO ] [Real]Absence check using 0 positive and 197 generalized place invariants in 127 ms returned sat
[2023-03-22 23:45:40] [INFO ] After 1516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 23:45:41] [INFO ] [Nat]Absence check using 0 positive and 197 generalized place invariants in 133 ms returned sat
[2023-03-22 23:45:48] [INFO ] After 6827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 23:45:52] [INFO ] After 10786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3068 ms.
[2023-03-22 23:45:55] [INFO ] After 15374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
FORMULA LeafsetExtension-PT-S64C3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 8 properties in 31 ms.
All properties solved without resorting to model-checking.
Total runtime 78707 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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: LeafsetExtension_PT_S64C3
(NrP: 21462 NrTr: 21129 NrArc: 67740)

parse formulas
formulas created successfully
place and transition orderings generation:1m30.125sec

net check time: 0m 0.012sec

init dd package: 0m 2.696sec


before gc: list nodes free: 1736013

after gc: idd nodes used:11314, unused:63988686; list nodes free:257870394

before gc: list nodes free: 1654026

after gc: idd nodes used:15999, unused:63984001; list nodes free:257837597

before gc: list nodes free: 1679324

after gc: idd nodes used:19594, unused:63980406; list nodes free:257812408
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6574220 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16085684 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 ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
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 1.134sec

299392 791965

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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityFireability"
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 LeafsetExtension-PT-S64C3, 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 r234-tall-167856420400535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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