About the Execution of Irma.full for DLCshifumi-PT-2a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2526.550 | 7329.00 | 5662.00 | 554.00 | TFTFFTFFTTTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 213K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCshifumi-PT-2a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-smll-152649737200157
=====================================================================
--------------------
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 DLCshifumi-PT-2a-CTLCardinality-00
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-01
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-02
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-03
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-04
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-05
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-06
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-07
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-08
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-09
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-10
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-11
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-12
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-13
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-14
FORMULA_NAME DLCshifumi-PT-2a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526654225466
BK_STOP 1526654232795
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCshifumi-PT-2a as instance name.
Using DLCshifumi as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 4227, 'Memory': 2208.2, 'Tool': 'marcie'}, {'Time': 4574, 'Memory': 2208.2, 'Tool': 'marcie'}, {'Time': 5204, 'Memory': 263.26, 'Tool': 'itstools'}, {'Time': 5481, 'Memory': 277.9, 'Tool': 'itstools'}, {'Time': 1532809, 'Memory': 7867.39, 'Tool': 'lola'}, {'Time': 1534569, 'Memory': 7822.41, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 362.6233735509818x far from the best tool marcie.
CTLCardinality marcie DLCshifumi-PT-2a...
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: DLCshifumi_PT_2a
(NrP: 188 NrTr: 888 NrArc: 3166)
check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
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
net check time: 0m 0.000sec
init dd package: 0m 1.571sec
RS generation: 0m 0.023sec
-> reachability set: #nodes 188 (1.9e+02) #states 474,756,150,994,301 (14)
starting MCC model checker
--------------------------
checking: ~ [AG [EF [3<=p56]]]
normalized: E [true U ~ [E [true U 3<=p56]]]
abstracting: (3<=p56)
states: 0
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: EG [AG [~ [2<=p92]]]
normalized: EG [~ [E [true U 2<=p92]]]
abstracting: (2<=p92)
states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [EF [3<=p27] U 2<=p166]
normalized: E [E [true U 3<=p27] U 2<=p166]
abstracting: (2<=p166)
states: 0
abstracting: (3<=p27)
states: 0
-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EG [AG [p46<=p167]]
normalized: EG [~ [E [true U ~ [p46<=p167]]]]
abstracting: (p46<=p167)
states: 474,756,150,994,301 (14)
EG iterations: 0
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AF [~ [AG [p51<=p133]]]
normalized: ~ [EG [~ [E [true U ~ [p51<=p133]]]]]
abstracting: (p51<=p133)
states: 474,756,150,994,301 (14)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [E [p107<=p4 U 3<=p58]]
normalized: ~ [EG [~ [E [p107<=p4 U 3<=p58]]]]
abstracting: (3<=p58)
states: 0
abstracting: (p107<=p4)
states: 434,062,766,623,361 (14)
EG iterations: 0
-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [E [~ [3<=p170] U [3<=p53 | 2<=p83]]]
normalized: ~ [E [~ [3<=p170] U [3<=p53 | 2<=p83]]]
abstracting: (2<=p83)
states: 0
abstracting: (3<=p53)
states: 0
abstracting: (3<=p170)
states: 0
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [EX [[1<=p141 | p11<=p25]]]
normalized: ~ [E [true U ~ [EX [[1<=p141 | p11<=p25]]]]]
abstracting: (p11<=p25)
states: 416,622,744,750,101 (14)
abstracting: (1<=p141)
states: 474,756,150,994,300 (14)
.-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: AG [[EF [p137<=p120] | EX [2<=p48]]]
normalized: ~ [E [true U ~ [[E [true U p137<=p120] | EX [2<=p48]]]]]
abstracting: (2<=p48)
states: 0
.abstracting: (p137<=p120)
states: 47,475,615,099,431 (13)
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: [AG [~ [~ [p32<=p129]]] | 1<=p81]
normalized: [1<=p81 | ~ [E [true U ~ [p32<=p129]]]]
abstracting: (p32<=p129)
states: 474,756,150,994,301 (14)
abstracting: (1<=p81)
states: 67,822,307,284,900 (13)
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EX [EF [[p176<=p0 & p60<=p18]]]
normalized: EX [E [true U [p176<=p0 & p60<=p18]]]
abstracting: (p60<=p18)
states: 416,622,744,750,101 (14)
abstracting: (p176<=p0)
states: 1
.-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: [EX [~ [~ [p171<=p68]]] | E [[p95<=p31 | 3<=p14] U 2<=p0]]
normalized: [EX [p171<=p68] | E [[p95<=p31 | 3<=p14] U 2<=p0]]
abstracting: (2<=p0)
states: 0
abstracting: (3<=p14)
states: 0
abstracting: (p95<=p31)
states: 416,622,744,750,101 (14)
abstracting: (p171<=p68)
states: 67,822,307,284,901 (13)
.-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: ~ [[EF [[2<=p120 | 3<=p117]] | [~ [~ [p105<=p132]] & [p65<=p26 & [2<=p142 | 1<=p141]]]]]
normalized: ~ [[[p105<=p132 & [p65<=p26 & [2<=p142 | 1<=p141]]] | E [true U [2<=p120 | 3<=p117]]]]
abstracting: (3<=p117)
states: 0
abstracting: (2<=p120)
states: 0
abstracting: (1<=p141)
states: 474,756,150,994,300 (14)
abstracting: (2<=p142)
states: 0
abstracting: (p65<=p26)
states: 416,622,744,750,101 (14)
abstracting: (p105<=p132)
states: 474,756,150,994,301 (14)
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [[[[~ [p36<=p127] | p33<=p57] & EF [3<=p74]] | [EX [2<=p52] | ~ [[p107<=p141 | 1<=p1]]]] | EF [3<=p104]]
normalized: [E [true U 3<=p104] | [[[p33<=p57 | ~ [p36<=p127]] & E [true U 3<=p74]] | [~ [[p107<=p141 | 1<=p1]] | EX [2<=p52]]]]
abstracting: (2<=p52)
states: 0
.abstracting: (1<=p1)
states: 67,822,307,284,900 (13)
abstracting: (p107<=p141)
states: 474,756,150,994,301 (14)
abstracting: (3<=p74)
states: 0
abstracting: (p36<=p127)
states: 474,756,150,994,301 (14)
abstracting: (p33<=p57)
states: 416,622,744,750,101 (14)
abstracting: (3<=p104)
states: 0
-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: [[~ [EF [3<=p49]] & [AG [3<=p116] | [[p137<=p53 & p110<=p17] & ~ [1<=p105]]]] | [AX [[1<=p29 & p122<=p135]] & ~ [EF [1<=p84]]]]
normalized: [[[[[p137<=p53 & p110<=p17] & ~ [1<=p105]] | ~ [E [true U ~ [3<=p116]]]] & ~ [E [true U 3<=p49]]] | [~ [E [true U 1<=p84]] & ~ [EX [~ [[1<=p29 & p122<=p135]]]]]]
abstracting: (p122<=p135)
states: 474,756,150,994,301 (14)
abstracting: (1<=p29)
states: 67,822,307,284,900 (13)
.abstracting: (1<=p84)
states: 67,822,307,284,900 (13)
abstracting: (3<=p49)
states: 0
abstracting: (3<=p116)
states: 0
abstracting: (1<=p105)
states: 67,822,307,284,900 (13)
abstracting: (p110<=p17)
states: 434,062,766,623,361 (14)
abstracting: (p137<=p53)
states: 67,822,307,284,901 (13)
-> the formula is TRUE
FORMULA DLCshifumi-PT-2a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: [[[[[p180<=p168 & p9<=p110] & 3<=p108] | [3<=p125 | [p187<=p137 | 3<=p118]]] & AG [[p140<=p136 | p67<=p126]]] & EF [~ [[p114<=p73 | p106<=p3]]]]
normalized: [[~ [E [true U ~ [[p140<=p136 | p67<=p126]]]] & [[3<=p108 & [p180<=p168 & p9<=p110]] | [3<=p125 | [p187<=p137 | 3<=p118]]]] & E [true U ~ [[p114<=p73 | p106<=p3]]]]
abstracting: (p106<=p3)
states: 434,062,766,623,361 (14)
abstracting: (p114<=p73)
states: 434,062,766,623,361 (14)
abstracting: (3<=p118)
states: 0
abstracting: (p187<=p137)
states: 474,756,150,994,301 (14)
abstracting: (3<=p125)
states: 0
abstracting: (p9<=p110)
states: 413,716,074,437,891 (14)
abstracting: (p180<=p168)
states: 474,756,150,994,301 (14)
abstracting: (3<=p108)
states: 0
abstracting: (p67<=p126)
states: 474,756,150,994,301 (14)
abstracting: (p140<=p136)
states: 474,756,150,994,301 (14)
-> the formula is FALSE
FORMULA DLCshifumi-PT-2a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
totally nodes used: 114534(1.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 305367 428171 733538
used/not used/entry size/cache size: 411569 66697295 16 1024MB
basic ops cache: hits/miss/sum: 105253 119925 225178
used/not used/entry size/cache size: 256515 16520701 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 1283 1540 2823
used/not used/entry size/cache size: 1538 2095614 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66994432
1 114330
2 102
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 2.663sec
.............................
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="DLCshifumi-PT-2a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2a.tgz
mv DLCshifumi-PT-2a execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is DLCshifumi-PT-2a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-smll-152649737200157"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
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 ;