Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r132-oct2-155403939200100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is QuasiCertifProtocol-PT-28, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939200100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 30K Feb 12 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 12 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 8 12:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 8 12:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 34K Feb 5 00:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 5 00:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 4 13:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Feb 4 13:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 1 10:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 1 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1554073794016

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-28 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-28 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-28 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3444/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: Size of bit vector: 95936
lola: finding significant places
lola: 2998 places, 446 transitions, 445 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 591 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-28-UpperBounds.task
lola: MAX(n9_19_10 + n9_19_11 + n9_19_12 + n9_19_13 + n9_19_14 + n9_19_15 + n9_19_16 + n9_19_17 + n9_19_18 + n9_19_19 + n9_19_20 + n9_19_21 + n9_19_22 + n9_19_23 + n9_19_24 + n9_19_25 + n9_19_26 + n9_19_27 + n9_19_28 + n9_7_10 + n9_20_10 + n9_6_10 + n9_20_9 + n9_20_8 + n9_20_7 + n9_20_6 + n9_20_5 + n9_20_4 + n9_20_3 + n9_20_2 + n9_20_1 + n9_20_0 + n9_1_10 + n9_13_10 + n9_13_11 + n9_13_12 + n9_13_13 + n9_13_14 + n9_13_15 + n9_13_16 + n9_13_17 + n9_13_18 + n9_13_19 + n9_13_20 + n9_13_21 + n9_13_22 + n9_13_23 + n9_13_24 + n9_13_25 + n9_13_26 + n9_13_27 + n9_13_28 + n9_25_10 + n9_25_11 + n9_25_12 + n9_25_13 + n9_25_14 + n9_25_15 + n9_25_16 + n9_25_17 + n9_25_18 + n9_25_19 + n9_25_20 + n9_25_21 + n9_25_22 + n9_25_23 + n9_25_24 + n9_25_25 + n9_25_26 + n9_25_27 + n9_25_28 + n9_1_11 + n9_1_12 + n9_1_13 + n9_1_14 + n9_1_15 + n9_1_16 + n9_1_17 + n9_1_18 + n9_1_19 + n9_1_20 + n9_1_21 + n9_1_22 + n9_1_23 + n9_1_24 + n9_1_25 + n9_1_26 + n9_1_27 + n9_1_28 + n9_18_10 + n9_18_11 + n9_18_12 + n9_18_13 + n9_18_14 + n9_18_15 + n9_18_16 + n9_18_17 + n9_18_18 + n9_18_19 + n9_18_20 + n9_18_21 + n9_18_22 + n9_18_23 + n9_18_24 + n9_18_25 + n9_18_26 + n9_18_27 + n9_18_28 + n9_21_0 + n9_21_1 + n9_21_2 + n9_21_3 + n9_21_4 + n9_21_5 + n9_21_6 + n9_21_7 + n9_21_8 + n9_21_9 + n9_6_11 + n9_6_12 + n9_6_13 + n9_6_14 + n9_6_15 + n9_6_16 + n9_6_17 + n9_6_18 + n9_6_19 + n9_6_20 + n9_6_21 + n9_6_22 + n9_6_23 + n9_6_24 + n9_6_25 + n9_6_26 + n9_6_27 + n9_6_28 + n9_22_0 + n9_22_1 + n9_22_2 + n9_22_3 + n9_22_4 + n9_22_5 + n9_22_6 + n9_22_7 + n9_22_8 + n9_22_9 + n9_12_10 + n9_12_11 + n9_12_12 + n9_12_13 + n9_12_14 + n9_12_15 + n9_12_16 + n9_12_17 + n9_12_18 + n9_12_19 + n9_12_20 + n9_12_21 + n9_12_22 + n9_12_23 + n9_12_24 + n9_12_25 + n9_12_26 + n9_12_27 + n9_12_28 + n9_24_10 + n9_24_11 + n9_24_12 + n9_24_13 + n9_24_14 + n9_24_15 + n9_24_16 + n9_24_17 + n9_24_18 + n9_24_19 + n9_24_20 + n9_24_21 + n9_24_22 + n9_24_23 + n9_24_24 + n9_24_25 + n9_24_26 + n9_24_27 + n9_24_28 + n9_0_10 + n9_0_11 + n9_0_12 + n9_0_13 + n9_0_14 + n9_0_15 + n9_0_16 + n9_0_17 + n9_0_18 + n9_0_19 + n9_0_20 + n9_0_21 + n9_0_22 + n9_0_23 + n9_0_24 + n9_0_25 + n9_0_26 + n9_0_27 + n9_0_28 + n9_23_0 + n9_23_1 + n9_23_2 + n9_23_3 + n9_23_4 + n9_23_5 + n9_23_6 + n9_23_7 + n9_23_8 + n9_23_9 + n9_10_0 + n9_10_1 + n9_10_2 + n9_10_3 + n9_10_4 + n9_10_5 + n9_10_6 + n9_10_7 + n9_10_8 + n9_10_9 + n9_17_10 + n9_17_11 + n9_17_12 + n9_17_13 + n9_17_14 + n9_17_15 + n9_17_16 + n9_17_17 + n9_17_18 + n9_17_19 + n9_17_20 + n9_17_21 + n9_17_22 + n9_17_23 + n9_17_24 + n9_17_25 + n9_17_26 + n9_17_27 + n9_17_28 + n9_24_0 + n9_24_1 + n9_24_2 + n9_24_3 + n9_24_4 + n9_24_5 + n9_0_0 + n9_24_6 + n9_0_1 + n9_24_7 + n9_0_2 + n9_24_8 + n9_0_3 + n9_24_9 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_11_0 + n9_11_1 + n9_11_2 + n9_11_3 + n9_11_4 + n9_11_5 + n9_11_6 + n9_11_7 + n9_11_8 + n9_11_9 + n9_5_10 + n9_5_11 + n9_5_12 + n9_5_13 + n9_5_14 + n9_5_15 + n9_5_16 + n9_5_17 + n9_5_18 + n9_5_19 + n9_5_20 + n9_5_21 + n9_5_22 + n9_5_23 + n9_5_24 + n9_5_25 + n9_5_26 + n9_5_27 + n9_5_28 + n9_25_0 + n9_25_1 + n9_25_2 + n9_25_3 + n9_25_4 + n9_25_5 + n9_1_0 + n9_25_6 + n9_1_1 + n9_25_7 + n9_1_2 + n9_25_8 + n9_1_3 + n9_25_9 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_12_0 + n9_12_1 + n9_12_2 + n9_12_3 + n9_12_4 + n9_12_5 + n9_12_6 + n9_12_7 + n9_12_8 + n9_12_9 + n9_11_10 + n9_11_11 + n9_11_12 + n9_11_13 + n9_11_14 + n9_11_15 + n9_11_16 + n9_11_17 + n9_11_18 + n9_11_19 + n9_11_20 + n9_11_21 + n9_11_22 + n9_11_23 + n9_11_24 + n9_11_25 + n9_11_26 + n9_11_27 + n9_11_28 + n9_23_10 + n9_23_11 + n9_23_12 + n9_23_13 + n9_23_14 + n9_23_15 + n9_23_16 + n9_23_17 + n9_23_18 + n9_23_19 + n9_23_20 + n9_23_21 + n9_23_22 + n9_23_23 + n9_23_24 + n9_23_25 + n9_23_26 + n9_23_27 + n9_23_28 + n9_20_28 + n9_20_27 + n9_20_26 + n9_20_25 + n9_20_24 + n9_20_23 + n9_20_22 + n9_20_21 + n9_20_20 + n9_20_19 + n9_20_18 + n9_26_0 + n9_26_1 + n9_26_2 + n9_26_3 + n9_26_4 + n9_26_5 + n9_2_0 + n9_26_6 + n9_2_1 + n9_26_7 + n9_2_2 + n9_26_8 + n9_2_3 + n9_26_9 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_13_0 + n9_13_1 + n9_13_2 + n9_13_3 + n9_13_4 + n9_13_5 + n9_13_6 + n9_13_7 + n9_13_8 + n9_13_9 + n9_20_17 + n9_20_16 + n9_20_15 + n9_20_14 + n9_20_13 + n9_27_0 + n9_27_1 + n9_27_2 + n9_27_3 + n9_27_4 + n9_27_5 + n9_3_0 + n9_27_6 + n9_3_1 + n9_27_7 + n9_3_2 + n9_27_8 + n9_3_3 + n9_27_9 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_20_12 + n9_16_10 + n9_16_11 + n9_16_12 + n9_16_13 + n9_16_14 + n9_16_15 + n9_16_16 + n9_16_17 + n9_16_18 + n9_16_19 + n9_16_20 + n9_16_21 + n9_16_22 + n9_16_23 + n9_16_24 + n9_16_25 + n9_16_26 + n9_16_27 + n9_16_28 + n9_14_0 + n9_14_1 + n9_14_2 + n9_14_3 + n9_14_4 + n9_14_5 + n9_14_6 + n9_14_7 + n9_14_8 + n9_14_9 + n9_28_10 + n9_28_11 + n9_28_12 + n9_28_13 + n9_28_14 + n9_28_15 + n9_28_16 + n9_28_17 + n9_28_18 + n9_28_19 + n9_28_20 + n9_28_21 + n9_28_22 + n9_28_23 + n9_28_24 + n9_28_25 + n9_28_26 + n9_28_27 + n9_28_28 + n9_4_10 + n9_4_11 + n9_4_12 + n9_4_13 + n9_4_14 + n9_4_15 + n9_4_16 + n9_4_17 + n9_4_18 + n9_4_19 + n9_4_20 + n9_4_21 + n9_4_22 + n9_4_23 + n9_4_24 + n9_4_25 + n9_4_26 + n9_4_27 + n9_4_28 + n9_28_0 + n9_28_1 + n9_28_2 + n9_28_3 + n9_28_4 + n9_28_5 + n9_4_0 + n9_28_6 + n9_4_1 + n9_28_7 + n9_4_2 + n9_28_8 + n9_4_3 + n9_28_9 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_20_11 + n9_15_0 + n9_15_1 + n9_15_2 + n9_15_3 + n9_15_4 + n9_15_5 + n9_15_6 + n9_15_7 + n9_15_8 + n9_15_9 + n9_7_28 + n9_7_27 + n9_7_26 + n9_7_25 + n9_7_24 + n9_7_23 + n9_7_22 + n9_7_21 + n9_7_20 + n9_7_19 + n9_7_18 + n9_7_17 + n9_7_16 + n9_7_15 + n9_7_14 + n9_7_13 + n9_7_12 + n9_7_11 + n9_9_10 + n9_9_11 + n9_9_12 + n9_9_13 + n9_9_14 + n9_9_15 + n9_9_16 + n9_9_17 + n9_9_18 + n9_9_19 + n9_9_20 + n9_9_21 + n9_9_22 + n9_9_23 + n9_9_24 + n9_9_25 + n9_9_26 + n9_9_27 + n9_9_28 + n9_10_10 + n9_10_11 + n9_10_12 + n9_10_13 + n9_10_14 + n9_10_15 + n9_10_16 + n9_10_17 + n9_10_18 + n9_10_19 + n9_10_20 + n9_10_21 + n9_10_22 + n9_10_23 + n9_10_24 + n9_10_25 + n9_10_26 + n9_10_27 + n9_10_28 + n9_22_10 + n9_22_11 + n9_22_12 + n9_22_13 + n9_22_14 + n9_22_15 + n9_22_16 + n9_22_17 + n9_22_18 + n9_22_19 + n9_22_20 + n9_22_21 + n9_22_22 + n9_22_23 + n9_22_24 + n9_22_25 + n9_22_26 + n9_22_27 + n9_22_28 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_16_0 + n9_16_1 + n9_16_2 + n9_16_3 + n9_16_4 + n9_16_5 + n9_16_6 + n9_16_7 + n9_16_8 + n9_16_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_17_0 + n9_17_1 + n9_17_2 + n9_17_3 + n9_17_4 + n9_17_5 + n9_17_6 + n9_17_7 + n9_17_8 + n9_17_9 + n9_15_10 + n9_15_11 + n9_15_12 + n9_15_13 + n9_15_14 + n9_15_15 + n9_15_16 + n9_15_17 + n9_15_18 + n9_15_19 + n9_15_20 + n9_15_21 + n9_15_22 + n9_15_23 + n9_15_24 + n9_15_25 + n9_15_26 + n9_15_27 + n9_15_28 + n9_27_10 + n9_27_11 + n9_27_12 + n9_27_13 + n9_27_14 + n9_27_15 + n9_27_16 + n9_27_17 + n9_27_18 + n9_27_19 + n9_27_20 + n9_27_21 + n9_27_22 + n9_27_23 + n9_27_24 + n9_27_25 + n9_27_26 + n9_27_27 + n9_27_28 + n9_3_10 + n9_3_11 + n9_3_12 + n9_3_13 + n9_3_14 + n9_3_15 + n9_3_16 + n9_3_17 + n9_3_18 + n9_3_19 + n9_3_20 + n9_3_21 + n9_3_22 + n9_3_23 + n9_3_24 + n9_3_25 + n9_3_26 + n9_3_27 + n9_3_28 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_18_0 + n9_18_1 + n9_18_2 + n9_18_3 + n9_18_4 + n9_18_5 + n9_18_6 + n9_18_7 + n9_18_8 + n9_18_9 + n9_8_10 + n9_8_11 + n9_8_12 + n9_8_13 + n9_8_14 + n9_8_15 + n9_8_16 + n9_8_17 + n9_8_18 + n9_8_19 + n9_8_20 + n9_8_21 + n9_8_22 + n9_8_23 + n9_8_24 + n9_8_25 + n9_8_26 + n9_8_27 + n9_8_28 + n9_21_10 + n9_21_11 + n9_21_12 + n9_21_13 + n9_21_14 + n9_21_15 + n9_21_16 + n9_21_17 + n9_21_18 + n9_21_19 + n9_21_20 + n9_21_21 + n9_21_22 + n9_21_23 + n9_21_24 + n9_21_25 + n9_21_26 + n9_21_27 + n9_21_28 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_19_0 + n9_19_1 + n9_19_2 + n9_19_3 + n9_19_4 + n9_19_5 + n9_19_6 + n9_19_7 + n9_19_8 + n9_19_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_14_10 + n9_14_11 + n9_14_12 + n9_14_13 + n9_14_14 + n9_14_15 + n9_14_16 + n9_14_17 + n9_14_18 + n9_14_19 + n9_14_20 + n9_14_21 + n9_14_22 + n9_14_23 + n9_14_24 + n9_14_25 + n9_14_26 + n9_14_27 + n9_14_28 + n9_26_10 + n9_26_11 + n9_26_12 + n9_26_13 + n9_26_14 + n9_26_15 + n9_26_16 + n9_26_17 + n9_26_18 + n9_26_19 + n9_26_20 + n9_26_21 + n9_26_22 + n9_26_23 + n9_26_24 + n9_26_25 + n9_26_26 + n9_26_27 + n9_26_28 + n9_2_10 + n9_2_11 + n9_2_12 + n9_2_13 + n9_2_14 + n9_2_15 + n9_2_16 + n9_2_17 + n9_2_18 + n9_2_19 + n9_2_20 + n9_2_21 + n9_2_22 + n9_2_23 + n9_2_24 + n9_2_25 + n9_2_26 + n9_2_27 + n9_2_28) : MAX(a5) : MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_28 + c1_27 + c1_26 + c1_25 + c1_24 + c1_23 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_11 + s3_12 + s3_13 + s3_14 + s3_15 + s3_16 + s3_17 + s3_18 + s3_19 + s3_20 + s3_21 + s3_22 + s3_23 + s3_24 + s3_25 + s3_26 + s3_27 + s3_28 + s3_9) : MAX(CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 + CstopOK_23 + CstopOK_24 + CstopOK_25 + CstopOK_26 + CstopOK_27 + CstopOK_28) : MAX(AstopAbort) : MAX(s5_28 + s5_27 + s5_26 + s5_25 + s5_24 + s5_23 + s5_22 + s5_21 + s5_20 + s5_19 + s5_18 + s5_17 + s5_16 + s5_15 + s5_14 + s5_13 + s5_12 + s5_11 + s5_10 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9) : MAX(n7_2_1) : MAX(n3_6) : MAX(n7_0_26) : MAX(Cstart_5) : MAX(n1_15) : MAX(n7_20_18) : MAX(n8_5_14) : MAX(Cstart_6)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a5)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 64 markings, 63 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-1 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(AstopAbort)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(AstopAbort)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-6 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_2_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_2_1)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 66 markings, 65 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n3_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n3_6)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 33 markings, 32 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_0_26)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_0_26)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 66 markings, 65 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Cstart_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Cstart_5)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n1_15)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n1_15)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n7_20_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_20_18)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 66 markings, 65 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_5_14)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_5_14)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 123 markings, 122 edges

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Cstart_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Cstart_6)
lola: processed formula length: 13
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_28 + c1_27 + c1_26 + c1_25 + c1_24 + c1_23 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_28 + c1_27 + c1_26 + c1_25 + c1_24 + c1_23 + c1_22 + c1_21 + c1_20 + c1_19 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9)
lola: processed formula length: 224
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 29
lola: SUBRESULT
lola: result: 29
lola: produced by: state space
lola: The maximum value of the given expression is 29
lola: 151 markings, 150 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-2 29 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s5_28 + s5_27 + s5_26 + s5_25 + s5_24 + s5_23 + s5_22 + s5_21 + s5_20 + s5_19 + s5_18 + s5_17 + s5_16 + s5_15 + s5_14 + s5_13 + s5_12 + s5_11 + s5_10 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s5_28 + s5_27 + s5_26 + s5_25 + s5_24 + s5_23 + s5_22 + s5_21 + s5_20 + s5_19 + s5_18 + s5_17 + s5_16 + s5_15 + s5_14 + s5_13 + s5_12 + s5_11 + s5_10 + s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9)
lola: processed formula length: 224
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 29
lola: SUBRESULT
lola: result: 29
lola: produced by: state space
lola: The maximum value of the given expression is 29
lola: 122 markings, 121 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-7 29 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: processed formula length: 224
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 29
lola: SUBRESULT
lola: result: 29
lola: produced by: state space
lola: The maximum value of the given expression is 29
lola: 93 markings, 92 edges

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-3 29 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_11 + s3_12 + s3_13 + s3_14 + s3_15 + s3_16 + s3_17 + s3_18 + s3_19 + s3_20 + s3_21 + s3_22 + s3_23 + s3_24 + s3_25 + s3_26 + s3_27 + s3_28 + s3_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_11 + s3_12 + s3_13 + s3_14 + s3_15 + s3_16 + s3_17 + s3_18 + s3_19 + s3_20 + s3_21 + s3_22 + s3_23 + s3_24 + s3_25 + s3_26 + s3_27 + s3_28 + s3_9)
lola: processed formula length: 224
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 29
lola: SUBRESULT
lola: result: 29
lola: produced by: state space
lola: The maximum value of the given expression is 29
lola: 62 markings, 61 edges
lola:
========================================
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-4 29 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 + CstopOK_23 + CstopOK_24 + CstopOK_25 + CstopOK_26 + CstopOK_27 + CstopOK_28)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + CstopOK_19 + CstopOK_20 + CstopOK_21 + CstopOK_22 + CstopOK_23 + CstopOK_24 + CstopOK_25 + CstopOK_26 + CstopOK_27 + CstopOK_28)
lola: processed formula length: 369
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 29
lola: SUBRESULT
lola: result: 29
lola: produced by: state space
lola: The maximum value of the given expression is 29
lola: 238 markings, 237 edges

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-5 29 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_19_10 + n9_19_11 + n9_19_12 + n9_19_13 + n9_19_14 + n9_19_15 + n9_19_16 + n9_19_17 + n9_19_18 + n9_19_19 + n9_19_20 + n9_19_21 + n9_19_22 + n9_19_23 + n9_19_24 + n9_19_25 + n9_19_26 + n9_19_27 + n9_19_28 + n9_7_10 + n9_20_10 + n9_6_10 + n9_20_9 + n9_20_8 + n9_20_7 + n9_20_6 + n9_20_5 + n9_20_4 + n9_20_3 + n9_20_2 + n9_20_1 + n9_20_0 + n9_1_10 + n9_13_10 + n9_13_11 + n9_13_12 + n9_13_13 + n9... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_19_10 + n9_19_11 + n9_19_12 + n9_19_13 + n9_19_14 + n9_19_15 + n9_19_16 + n9_19_17 + n9_19_18 + n9_19_19 + n9_19_20 + n9_19_21 + n9_19_22 + n9_19_23 + n9_19_24 + n9_19_25 + n9_19_26 + n9_19_27 + n9_19_28 + n9_7_10 + n9_20_10 + n9_6_10 + n9_20_9 + n9_20_8 + n9_20_7 + n9_20_6 + n9_20_5 + n9_20_4 + n9_20_3 + n9_20_2 + n9_20_1 + n9_20_0 + n9_1_10 + n9_13_10 + n9_13_11 + n9_13_12 + n9_13_13 + n9... (shortened)
lola: processed formula length: 8673
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-28-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 841
lola: SUBRESULT
lola: result: 841
lola: produced by: state space
lola: The maximum value of the given expression is 841
lola: 209 markings, 208 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-28-UpperBounds-0 841 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 841 1 29 29 29 29 1 29 1 1 1 1 1 1 1 1
lola:
preliminary result: 841 1 29 29 29 29 1 29 1 1 1 1 1 1 1 1
lola: memory consumption: 21324 KB
lola: time consumption: 16 seconds

BK_STOP 1554073810939

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="QuasiCertifProtocol-PT-28"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is QuasiCertifProtocol-PT-28, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-oct2-155403939200100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; 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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;