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.r010-oct2-167813599400686.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599400686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 AutonomousCar-PT-10b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678704737269

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=AutonomousCar-PT-10b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 10:52:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 10:52:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 10:52:20] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-13 10:52:20] [INFO ] Transformed 425 places.
[2023-03-13 10:52:20] [INFO ] Transformed 2252 transitions.
[2023-03-13 10:52:20] [INFO ] Found NUPN structural information;
[2023-03-13 10:52:20] [INFO ] Parsed PT model containing 425 places and 2252 transitions and 29816 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 72 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 14) seen :10
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2252 rows 425 cols
[2023-03-13 10:52:21] [INFO ] Computed 15 place invariants in 31 ms
[2023-03-13 10:52:21] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 10:52:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-13 10:52:23] [INFO ] After 1763ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 10:52:25] [INFO ] Deduced a trap composed of 16 places in 2082 ms of which 21 ms to minimize.
[2023-03-13 10:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2271 ms
[2023-03-13 10:52:27] [INFO ] Deduced a trap composed of 35 places in 1119 ms of which 1 ms to minimize.
[2023-03-13 10:52:28] [INFO ] Deduced a trap composed of 56 places in 1338 ms of which 0 ms to minimize.
[2023-03-13 10:52:30] [INFO ] Deduced a trap composed of 48 places in 1530 ms of which 1 ms to minimize.
[2023-03-13 10:52:31] [INFO ] Deduced a trap composed of 50 places in 1385 ms of which 2 ms to minimize.
[2023-03-13 10:52:33] [INFO ] Deduced a trap composed of 51 places in 1282 ms of which 1 ms to minimize.
[2023-03-13 10:52:34] [INFO ] Deduced a trap composed of 51 places in 892 ms of which 1 ms to minimize.
[2023-03-13 10:52:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 8008 ms
[2023-03-13 10:52:34] [INFO ] After 12397ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-13 10:52:34] [INFO ] After 12817ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 61 ms.
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 405 edges and 425 vertex of which 4 / 425 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.22 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 0 with 188 rules applied. Total rules applied 190 place count 416 transition count 2055
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 243 rules applied. Total rules applied 433 place count 230 transition count 1998
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 34 rules applied. Total rules applied 467 place count 197 transition count 1997
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 468 place count 196 transition count 1997
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 468 place count 196 transition count 1991
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 480 place count 190 transition count 1991
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 516 place count 154 transition count 1955
Iterating global reduction 4 with 36 rules applied. Total rules applied 552 place count 154 transition count 1955
Ensure Unique test removed 400 transitions
Reduce isomorphic transitions removed 400 transitions.
Iterating post reduction 4 with 400 rules applied. Total rules applied 952 place count 154 transition count 1555
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 952 place count 154 transition count 1553
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 956 place count 152 transition count 1553
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 966 place count 142 transition count 1462
Iterating global reduction 5 with 10 rules applied. Total rules applied 976 place count 142 transition count 1462
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 5 with 17 rules applied. Total rules applied 993 place count 142 transition count 1445
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1001 place count 134 transition count 1445
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1097 place count 86 transition count 1397
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1107 place count 76 transition count 1287
Iterating global reduction 7 with 10 rules applied. Total rules applied 1117 place count 76 transition count 1287
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1118 place count 76 transition count 1286
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 1129 place count 76 transition count 1275
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 1140 place count 65 transition count 1275
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1141 place count 65 transition count 1275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1142 place count 64 transition count 1274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1143 place count 63 transition count 1274
Applied a total of 1143 rules in 943 ms. Remains 63 /425 variables (removed 362) and now considering 1274/2252 (removed 978) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 63/425 places, 1274/2252 transitions.
Finished random walk after 3679 steps, including 17 resets, run visited all 1 properties in 69 ms. (steps per millisecond=53 )
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15723 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: AutonomousCar_PT_10b
(NrP: 425 NrTr: 2252 NrArc: 29816)

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

net check time: 0m 0.003sec

init dd package: 0m 2.862sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8935640 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098068 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:
++ 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
++ sed s/.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
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 0.014sec

3496991 3497041 3500265 3500248 3500811 3500817 3534939

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="AutonomousCar-PT-10b"
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 AutonomousCar-PT-10b, 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 r010-oct2-167813599400686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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