About the Execution of Marcie for BridgeAndVehicles-COL-V50P20N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5677.680 | 694389.00 | 693980.00 | 40.00 | ?F?F?????????T?F | 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)
..............
=====================================================================
Generated by BenchKit 2-2270
Executing tool marcie
Input is BridgeAndVehicles-COL-V50P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r190su-smll-143330904500113
=====================================================================
--------------------
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-COL-V50P20N10-ReachabilityCardinality-0
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8
FORMULA_NAME BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1433431550962
Model: BridgeAndVehicles-COL-V50P20N10
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
Unfolding complete |P|=128|T|=1328|A|=9457
Time for unfolding: 0m0sec
(NrP: 128 NrTr: 1328 NrArc: 9457)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 4m4sec
-> reachability set: #nodes 4960949 (5.0e+06) #states 4,584,304 (6)
starting MCC model checker
--------------------------
checking: EF [~ [[1<=VIDANGE | ROUTE_B<=ROUTE_B]]]
normalized: E [true U ~ [[1<=VIDANGE | ROUTE_B<=ROUTE_B]]]
abstracting: (ROUTE_B<=ROUTE_B) states: 0
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-0CANNOT_COMPUTE
MC time: 0m14sec
checking: AG [NB_ATTENTE_A<=COMPTEUR]
normalized: ~ [E [true U ~ [NB_ATTENTE_A<=COMPTEUR]]]
abstracting: (NB_ATTENTE_A<=COMPTEUR) states: 0
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m26sec
checking: AG [~ [[[SORTI_B<=SUR_PONT_A & 2<=VIDANGE] & [2<=ATTENTE_A | 3<=SORTI_A]]]]
normalized: ~ [E [true U [[SORTI_B<=SUR_PONT_A & 2<=VIDANGE] & [2<=ATTENTE_A | 3<=SORTI_A]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-2CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[VIDANGE<=ROUTE_B | 1<=ROUTE_B]]
normalized: ~ [E [true U ~ [[VIDANGE<=ROUTE_B | 1<=ROUTE_B]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-3CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [1<=NB_ATTENTE_A]
normalized: ~ [E [true U ~ [1<=NB_ATTENTE_A]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-4CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[~ [[ATTENTE_B<=COMPTEUR | SUR_PONT_B<=ATTENTE_B]] & 1<=ROUTE_A]]
normalized: E [true U [1<=ROUTE_A & ~ [[ATTENTE_B<=COMPTEUR | SUR_PONT_B<=ATTENTE_B]]]]
abstracting: (SUR_PONT_B<=ATTENTE_B) states: 0
abstracting: (ATTENTE_B<=COMPTEUR) states: 0
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-5CANNOT_COMPUTE
MC time: 0m28sec
checking: AG [~ [[[CHOIX<=COMPTEUR & 3<=CONTROLEUR] & [NB_ATTENTE_B<=NB_ATTENTE_A & SUR_PONT_A<=CONTROLEUR]]]]
normalized: ~ [E [true U [[NB_ATTENTE_B<=NB_ATTENTE_A & SUR_PONT_A<=CONTROLEUR] & [CHOIX<=COMPTEUR & 3<=CONTROLEUR]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-6CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [[SORTI_B<=CAPACITE | ~ [COMPTEUR<=COMPTEUR]]]
normalized: ~ [E [true U ~ [[SORTI_B<=CAPACITE | ~ [COMPTEUR<=COMPTEUR]]]]]
abstracting: (COMPTEUR<=COMPTEUR) states: 0
abstracting: (SORTI_B<=CAPACITE) states: 0
-> the formula is TRUE
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m28sec
checking: AG [[[ATTENTE_A<=CHOIX | 1<=ATTENTE_A] | NB_ATTENTE_A<=VIDANGE]]
normalized: ~ [E [true U ~ [[NB_ATTENTE_A<=VIDANGE | [ATTENTE_A<=CHOIX | 1<=ATTENTE_A]]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-8CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [[~ [~ [SORTI_B<=CHOIX]] & [[ROUTE_A<=CHOIX | ROUTE_B<=CAPACITE] | [ATTENTE_A<=ROUTE_B & CAPACITE<=NB_ATTENTE_A]]]]
normalized: E [true U [SORTI_B<=CHOIX & [[ATTENTE_A<=ROUTE_B & CAPACITE<=NB_ATTENTE_A] | [ROUTE_A<=CHOIX | ROUTE_B<=CAPACITE]]]]
abstracting: (ROUTE_B<=CAPACITE) states: 0
abstracting: (ROUTE_A<=CHOIX) states: 0
abstracting: (CAPACITE<=NB_ATTENTE_A) states: 0
abstracting: (ATTENTE_A<=ROUTE_B) states: 0
abstracting: (SORTI_B<=CHOIX) states: 0
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m8sec
checking: EF [2<=COMPTEUR]
normalized: E [true U 2<=COMPTEUR]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-10CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [NB_ATTENTE_B<=CAPACITE]
normalized: ~ [E [true U ~ [NB_ATTENTE_B<=CAPACITE]]]
abstracting: (NB_ATTENTE_B<=CAPACITE) states: 0
-> the formula is FALSE
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14sec
checking: AG [~ [~ [~ [3<=CONTROLEUR]]]]
normalized: ~ [E [true U 3<=CONTROLEUR]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-12CANNOT_COMPUTE
MC time: 0m0sec
checking: AG [~ [~ [[SORTI_B<=ROUTE_B | 1<=SUR_PONT_B]]]]
normalized: ~ [E [true U ~ [[SORTI_B<=ROUTE_B | 1<=SUR_PONT_B]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-13CANNOT_COMPUTE
MC time: 0m0sec
checking: EF [~ [[[CAPACITE<=NB_ATTENTE_B & SUR_PONT_A<=COMPTEUR] | 2<=ROUTE_B]]]
normalized: E [true U ~ [[2<=ROUTE_B | [CAPACITE<=NB_ATTENTE_B & SUR_PONT_A<=COMPTEUR]]]]
abstracting: (SUR_PONT_A<=COMPTEUR) states: 0
abstracting: (CAPACITE<=NB_ATTENTE_B) states: 0
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-14CANNOT_COMPUTE
MC time: 0m28sec
checking: EF [[[[3<=CONTROLEUR & 3<=ATTENTE_B] & ~ [2<=SORTI_A]] & 2<=VIDANGE]]
normalized: E [true U [2<=VIDANGE & [~ [2<=SORTI_A] & [3<=CONTROLEUR & 3<=ATTENTE_B]]]]
FORMULA BridgeAndVehicles-COL-V50P20N10-ReachabilityCardinality-15CANNOT_COMPUTE
MC time: 0m0sec
Total processing time: 11m34sec
BK_STOP 1433432245351
--------------------
content from stderr:
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: 0m0sec
201 1065 23315 32000 46786 62622 72599 80895 96729 111874 124637 138975 144249 165551 176172 191294 208211 219047 238329 250743 267824 282492 296714 304664 326802 336807 349189 349189 349709 350019 350849 351892 352989 354169 354259 356649 356975 358469 360019 360139 361809 363616 363679 367269 367577 367619 371609 371926 374269 376389 376703 376739 381569 384169 514029 515064 515595 516684 517242 517809 518970 519598 519698 519717 519765 519794 519851 519891 519930 520007 520057 520106 520203 520264 520323 520383 520441 522960 523385 523389 523398 523403 523415 523422 523462 523445 523454 523506 523483 523531 523506 523518 523587 523558 547299 620541 636656 636626 636614 636460 636354 636314 636080 635992 635845 635614 635564 635222 635234 634843 632994 619908 619914 619922 619927 619955 619944 619951 619966 619974 619983 620035 620012 620023 620088 620060 620116 620087 660282 687482 687420 687301 687167 687075 686870 686680 686536 686270 686081 685817 685540 685360 684990 684870 663702 663712 663716 663725 663753 663742 663749 663789 663772 663781 663833 663810 663821 663833 663845 663914 663885 695141 725789 725699 725585 725453 725357 725152 724955 724829 724542 724317 724109 723794 723677 723247 720605 702465 702471 702479 702484 702495 702501 702515 702523 702569 702549 702559 702569 702580 702645 702617 702630 702644 745393 763219 763150 763039 762884 762723 762613 762361 762135 762002 761674 761419 761203 760853 760733 740433 740439 740443 740452 740480 740469 740476 740516 740499 740508 740560 740537 740548 740613 740572 740641 740612 773145 799930 799870 799744 799592 799433 799318 799066 798839 798720 798376 798100 797938 797538 794994 777610 777616 777624 777629 777640 777646 777660 777668 777676 777694 777737 777714 777725 777790 777762 777818 777789 819261 835806 835715 835637 835465 835277 835082 834962 834668 834407 834287 833891 833602 833432 816422 814002 814006 814015 814020 814032 814039 814079 814062 814071 814123 814100 814111 814123 814135 814204 814175 839046 870945 870883 870754 870599 870420 870241 870091 869804 869551 869431 869035 868735 868595 849591 849597 849601 849610 849638 849627 849634 849674 849657 849666 849718 849695 849706 849718 849730 849799 849770 881026 905247 905155 905074 904902 904707 904495 904296 904128 903800 903523 903397 902967 900645 884395 884405 884409 884419 884425 884459 884445 884453 884499 884479 884489 884547 884522 884575 884547 884560 885006 936262 938736 938618 938466 938288 938096 937976 937682 937394 937139 936968 936558 934280 918408 918418 918422 918432 918438 918472 918458 918466 918512 918492 918502 918560 918535 918588 918560 918573 918931 968998 971472 971353 971199 971013 970810 970606 970445 970117 969820 969568 969338 953840 1372796 1793982 2215184 2531096 2741709 3057636 3268259 3478886 3689517 3900152 4110791 4321434 4417168 4582158 4716869 4774758 4875388 4919626 4960949
iterations count:413033 (311), effective:6247 (4)
initing FirstDep: 0m0sec
Unknown names:
VIDANGE
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
4960949
iterations count:1328 (1), effective:0 (0)
Unknown names:
SORTI_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ROUTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
NB_ATTENTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ROUTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
CONTROLEUR
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ATTENTE_A
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
COMPTEUR
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
4960949
iterations count:1328 (1), effective:0 (0)
Unknown names:
CONTROLEUR
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
SUR_PONT_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ROUTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
Unknown names:
ATTENTE_B
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula
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-COL-V50P20N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/BridgeAndVehicles-COL-V50P20N10.tgz
mv BridgeAndVehicles-COL-V50P20N10 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is BridgeAndVehicles-COL-V50P20N10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r190su-smll-143330904500113"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 '
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 ;