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-3254
Executing tool marcie
Input is S_CircularTrains-PT-384, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r081-csrt-149441064700628
=====================================================================

--------------------
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 CircularTrains-PT-384-ReachabilityCardinality-0
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-1
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-10
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-11
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-12
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-13
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-14
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-15
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-2
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-3
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-4
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-5
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-6
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-7
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-8
FORMULA_NAME CircularTrains-PT-384-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1494901557867

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=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: CircularTrains_PT_384
(NrP: 768 NrTr: 384 NrArc: 1536)

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

net check time: 0m 0.000sec

init dd package: 0m 1.249sec


RS generation: 0m 0.013sec


-> last computed set: #nodes 384 (3.8e+02) #states 1


parse successfull
net created successfully

Net: CircularTrains_PT_384
(NrP: 768 NrTr: 384 NrArc: 1536)

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

net check time: 0m 0.000sec

init dd package: 0m 4.080sec


before gc: list nodes free: 1648174

after gc: idd nodes used:182206, unused:63817794; list nodes free:298930020

before gc: list nodes free: 1216307

after gc: idd nodes used:145676, unused:63854324; list nodes free:299142874

before gc: list nodes free: 1249569

after gc: idd nodes used:233718, unused:63766282; list nodes free:298749036

RS generation: 25m53.100sec


-> reachability set: #nodes 196619 (2.0e+05) #states 16,376,641,351,227,849,741,077,397,217,895,636,582,218,158,650,060,650,984,502,471,241,967,517,991,687,943,434,910,035 (88)



starting MCC model checker
--------------------------

checking: EF [2<=Section_62]
normalized: E [true U 2<=Section_62]

abstracting: (2<=Section_62)
states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

checking: EF [2<=F300]
normalized: E [true U 2<=F300]

abstracting: (2<=F300)
states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[~ [~ [Section_253<=Section_23]] & 2<=Section_304]]
normalized: E [true U [Section_253<=Section_23 & 2<=Section_304]]

abstracting: (2<=Section_304)
states: 0
abstracting: (Section_253<=Section_23)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.517sec

checking: AG [[~ [[1<=Section_92 | 1<=Section_96]] | ~ [~ [Section_206<=Section_179]]]]
normalized: ~ [E [true U ~ [[Section_206<=Section_179 | ~ [[1<=Section_92 | 1<=Section_96]]]]]]

abstracting: (1<=Section_96)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (1<=Section_92)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (Section_206<=Section_179)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
MC time: 2m37.081sec

checking: EF [~ [[Section_302<=Section_382 | Section_115<=Section_11]]]
normalized: E [true U ~ [[Section_302<=Section_382 | Section_115<=Section_11]]]

abstracting: (Section_115<=Section_11)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
abstracting: (Section_302<=Section_382)
states: 11,146,386,631,797,675,813,361,831,422,207,325,787,057,490,543,896,417,640,321,181,331,733,577,941,228,285,649,332,186 (88)

before gc: list nodes free: 1314936

after gc: idd nodes used:1404328, unused:62595672; list nodes free:293286210
MC time: 2m25.027sec

checking: AG [~ [[[3<=Section_7 & Section_295<=F140] & 2<=F113]]]
normalized: ~ [E [true U [2<=F113 & [3<=Section_7 & Section_295<=F140]]]]

abstracting: (Section_295<=F140)
states: 15,854,165,086,093,040,928,627,184,012,022,017,542,640,480,929,664,548,786,609,809,315,349,465,681,157,858,616,449,662 (88)
abstracting: (3<=Section_7)
states: 0
abstracting: (2<=F113)
states: 5,890,493,782,889,202,459,999,881,669,957,149,416,454,174,146,658,479,551,140,466,740,934,016,051,580,225,699,310,718 (87)
-> the formula is TRUE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.027sec

checking: EF [[2<=F270 & [2<=F209 & ~ [Section_116<=Section_213]]]]
normalized: E [true U [2<=F270 & [2<=F209 & ~ [Section_116<=Section_213]]]]

abstracting: (Section_116<=Section_213)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
abstracting: (2<=F209)
states: 5,890,493,782,889,202,459,999,881,669,957,149,416,454,174,146,658,479,551,140,466,740,934,016,051,580,225,699,310,718 (87)
abstracting: (2<=F270)
states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.018sec

checking: AG [~ [[[3<=F24 | 3<=Section_180] & [Section_144<=F247 | 2<=Section_71]]]]
normalized: ~ [E [true U [[Section_144<=F247 | 2<=Section_71] & [3<=F24 | 3<=Section_180]]]]

abstracting: (3<=Section_180)
states: 0
abstracting: (3<=F24)
states: 0
abstracting: (2<=Section_71)
states: 0
abstracting: (Section_144<=F247)
states: 12,460,359,844,024,794,151,702,318,860,269,869,879,708,319,643,205,902,162,616,359,979,433,468,413,640,300,636,837,553 (88)
-> the formula is TRUE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.769sec

checking: AG [[[~ [3<=F38] | F338<=Section_374] | F179<=Section_332]]
normalized: ~ [E [true U ~ [[F179<=Section_332 | [F338<=Section_374 | ~ [3<=F38]]]]]]

abstracting: (3<=F38)
states: 0
abstracting: (F338<=Section_374)
states: 5,747,542,618,304,918,535,355,809,385,976,265,505,600,589,294,347,516,190,364,935,949,415,485,896,931,873,976,468,599 (87)
abstracting: (F179<=Section_332)
states: 5,747,542,618,304,918,535,355,809,385,976,265,505,600,589,294,347,516,190,364,935,949,415,485,896,931,873,976,468,599 (87)
-> the formula is TRUE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.825sec

checking: EF [[[~ [3<=F23] | [Section_236<=F377 | 1<=Section_350]] & 3<=F276]]
normalized: E [true U [3<=F276 & [[Section_236<=F377 | 1<=Section_350] | ~ [3<=F23]]]]

abstracting: (3<=F23)
states: 0
abstracting: (1<=Section_350)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (Section_236<=F377)
states: 15,346,950,217,916,403,132,203,415,531,538,935,420,229,938,435,916,512,630,298,540,294,424,022,281,700,438,707,293,662 (88)
abstracting: (3<=F276)
states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.539sec

checking: AG [[F339<=Section_213 & ~ [[F212<=F270 | 3<=F127]]]]
normalized: ~ [E [true U ~ [[F339<=Section_213 & ~ [[F212<=F270 | 3<=F127]]]]]]

abstracting: (3<=F127)
states: 0
abstracting: (F212<=F270)
states: 5,757,919,350,825,046,944,975,748,617,147,594,163,876,102,358,773,154,893,782,967,724,288,498,825,047,611,231,607,845 (87)
abstracting: (F339<=Section_213)
states: 12,460,359,844,024,794,151,702,318,860,269,869,879,708,319,643,205,902,162,616,359,979,433,468,413,640,300,636,837,553 (88)
MC time: 3m37.099sec

checking: EF [~ [[[3<=Section_264 & 2<=Section_22] | [1<=Section_213 | Section_265<=F205]]]]
normalized: E [true U ~ [[[3<=Section_264 & 2<=Section_22] | [1<=Section_213 | Section_265<=F205]]]]

abstracting: (Section_265<=F205)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
abstracting: (1<=Section_213)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (2<=Section_22)
states: 0
abstracting: (3<=Section_264)
states: 0

before gc: list nodes free: 1288488

after gc: idd nodes used:2494978, unused:61505022; list nodes free:288192813
MC time: 3m10.134sec

checking: EF [[~ [[F207<=Section_33 | F309<=F298]] & [2<=F146 | ~ [Section_163<=Section_97]]]]
normalized: E [true U [[2<=F146 | ~ [Section_163<=Section_97]] & ~ [[F207<=Section_33 | F309<=F298]]]]

abstracting: (F309<=F298)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
abstracting: (F207<=Section_33)
states: 12,460,359,844,024,794,151,702,318,860,269,869,879,708,319,643,205,902,162,616,359,979,433,468,413,640,300,636,837,553 (88)
abstracting: (Section_163<=Section_97)
states: 13,748,694,926,773,613,064,396,422,341,770,548,396,916,500,451,441,681,939,912,113,946,567,737,046,863,913,459,899,301 (88)
abstracting: (2<=F146)
states: 5,890,493,782,889,202,459,999,881,669,957,149,416,454,174,146,658,479,551,140,466,740,934,016,051,580,225,699,310,718 (87)
MC time: 2m46.063sec

checking: AG [[[1<=F240 | [F103<=F371 | Section_41<=Section_132]] | Section_106<=F133]]
normalized: ~ [E [true U ~ [[Section_106<=F133 | [1<=F240 | [F103<=F371 | Section_41<=Section_132]]]]]]

abstracting: (Section_41<=Section_132)

before gc: list nodes free: 1375104

after gc: idd nodes used:2828907, unused:61171093; list nodes free:286634256
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
abstracting: (F103<=F371)
states: 15,326,500,454,698,167,911,367,001,190,562,734,173,925,046,677,055,627,237,008,131,501,294,906,906,569,905,170,419,666 (88)
abstracting: (1<=F240)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (Section_106<=F133)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
MC time: 2m26.293sec

checking: EF [[[[3<=F338 & F306<=F364] | [3<=Section_243 & 2<=F104]] & [~ [2<=F127] & ~ [1<=Section_223]]]]
normalized: E [true U [[~ [1<=Section_223] & ~ [2<=F127]] & [[3<=Section_243 & 2<=F104] | [3<=F338 & F306<=F364]]]]

abstracting: (F306<=F364)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
abstracting: (3<=F338)
states: 0
abstracting: (2<=F104)
states: 5,890,493,782,889,202,459,999,881,669,957,149,416,454,174,146,658,479,551,140,466,740,934,016,051,580,225,699,310,718 (87)
abstracting: (3<=Section_243)
states: 0
abstracting: (2<=F127)
states: 0
abstracting: (1<=Section_223)
states: 3,288,185,487,913,265,208,965,290,750,393,926,806,595,164,239,113,215,251,549,534,126,099,856,945,944,597,888,743,603 (87)
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.879sec

checking: EF [[[3<=Section_12 & ~ [1<=Section_332]] & [~ [F44<=F83] | [Section_183<=Section_62 & Section_311<=Section_52]]]]
normalized: E [true U [[~ [F44<=F83] | [Section_183<=Section_62 & Section_311<=Section_52]] & [3<=Section_12 & ~ [1<=Section_332]]]]

abstracting: (1<=Section_332)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (3<=Section_12)
states: 0
abstracting: (Section_311<=Section_52)
states: 11,146,386,631,797,675,813,361,831,422,207,325,787,057,490,543,896,417,640,321,181,331,733,577,941,228,285,649,332,186 (88)
abstracting: (Section_183<=Section_62)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)
abstracting: (F44<=F83)
states: 11,337,780,822,507,375,762,854,299,624,574,387,313,268,732,934,921,037,245,034,363,331,345,965,331,389,220,346,661,324 (88)
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.729sec

checking: AG [[~ [[1<=Section_92 | 1<=Section_96]] | ~ [~ [Section_206<=Section_179]]]]
normalized: ~ [E [true U ~ [[Section_206<=Section_179 | ~ [[1<=Section_92 | 1<=Section_96]]]]]]

abstracting: (1<=Section_96)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (1<=Section_92)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)
abstracting: (Section_206<=Section_179)
states: 12,434,721,714,546,494,726,055,934,903,708,004,304,265,671,352,132,197,417,616,935,298,867,846,574,451,898,472,393,934 (88)

before gc: list nodes free: 1346980

after gc: idd nodes used:4554304, unused:59445696; list nodes free:278575347
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 7.672sec

checking: EF [~ [[Section_302<=Section_382 | Section_115<=Section_11]]]
normalized: E [true U ~ [[Section_302<=Section_382 | Section_115<=Section_11]]]

abstracting: (Section_115<=Section_11)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
abstracting: (Section_302<=Section_382)
states: 11,146,386,631,797,675,813,361,831,422,207,325,787,057,490,543,896,417,640,321,181,331,733,577,941,228,285,649,332,186 (88)

before gc: list nodes free: 1302250

after gc: idd nodes used:4521270, unused:59478730; list nodes free:278730683
-> the formula is TRUE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m 3.311sec

checking: AG [[F339<=Section_213 & ~ [[F212<=F270 | 3<=F127]]]]
normalized: ~ [E [true U ~ [[F339<=Section_213 & ~ [[F212<=F270 | 3<=F127]]]]]]

abstracting: (3<=F127)
states: 0
abstracting: (F212<=F270)
states: 5,757,919,350,825,046,944,975,748,617,147,594,163,876,102,358,773,154,893,782,967,724,288,498,825,047,611,231,607,845 (87)
abstracting: (F339<=Section_213)
states: 12,460,359,844,024,794,151,702,318,860,269,869,879,708,319,643,205,902,162,616,359,979,433,468,413,640,300,636,837,553 (88)
-> the formula is FALSE

FORMULA CircularTrains-PT-384-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m40.776sec

checking: EF [~ [[[3<=Section_264 & 2<=Section_22] | [1<=Section_213 | Section_265<=F205]]]]
normalized: E [true U ~ [[[1<=Section_213 | Section_265<=F205] | [3<=Section_264 & 2<=Section_22]]]]

abstracting: (2<=Section_22)
states: 0
abstracting: (3<=Section_264)
states: 0
abstracting: (Section_265<=F205)
states: 14,402,429,075,541,702,870,452,593,905,564,253,868,273,823,510,256,920,255,248,115,763,567,551,518,155,360,533,671,799 (88)
abstracting: (1<=Section_213)
states: 6,544,227,931,657,292,266,056,053,233,750,854,887,811,497,205,473,717,866,476,468,557,933,830,522,871,672,773,083,216 (87)

before gc: list nodes free: 1319009

after gc: idd nodes used:4388142, unused:59611858; list nodes free:279353483

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

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.002sec

zbdd.cc:1122: Boundedness exception: net is not 1-bounded!

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.002sec

217201
iterations count:122624 (319), effective:24576 (64)

initing FirstDep: 0m 0.002sec


sat_reach.icc:155: Timeout: after 156 sec


sat_reach.icc:155: Timeout: after 144 sec


sat_reach.icc:155: Timeout: after 216 sec


sat_reach.icc:155: Timeout: after 189 sec


sat_reach.icc:155: Timeout: after 165 sec


sat_reach.icc:155: Timeout: after 145 sec


iterations count:2858 (7), effective:572 (1)

iterations count:3431 (8), effective:763 (1)

iterations count:1539 (4), effective:385 (1)

iterations count:4183 (10), effective:761 (1)

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="S_CircularTrains-PT-384"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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/S_CircularTrains-PT-384.tgz
mv S_CircularTrains-PT-384 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_CircularTrains-PT-384, 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 r081-csrt-149441064700628"
echo "====================================================================="
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
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 ;