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 2.1M
-rw-r--r-- 1 mcc users 84K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 71K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 217K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 112K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 82K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 135K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 716K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is CSRepetitions-PT-07, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r035-ebro-152646315500467
=====================================================================

--------------------
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 CSRepetitions-PT-07-ReachabilityCardinality-00
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-01
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-02
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-03
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-04
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-05
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-06
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-07
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-08
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-09
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-10
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-11
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-12
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-13
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-14
FORMULA_NAME CSRepetitions-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1527145490463


BK_STOP 1527145536637

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CSRepetitions-PT-07 as instance name.
Using CSRepetitions as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, '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': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 575, 'Memory': 106.89, 'Tool': 'lola'}, {'Time': 829, 'Memory': 119.14, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola CSRepetitions-PT-07...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
CSRepetitions-PT-07: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
CSRepetitions-PT-07: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ CSRepetitions-PT-07 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1331/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 498 places, 833 transitions, 442 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1275 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-07-ReachabilityCardinality.task
lola: E (F (())) : A (G ((Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))) : A (G (((2 <= Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_Sending_24 + Client_Sending_25 + Client_Sending_26 + Client_Sending_27 + Client_Sending_28 + Client_Sending_29 + Client_Sending_30 + Client_Sending_31 + Client_Sending_32 + Client_Sending_33 + Client_Sending_34 + Client_Sending_35 + Client_Sending_36 + Client_Sending_37 + Client_Sending_38 + Client_Sending_39 + Client_Sending_40 + Client_Sending_41 + Client_Sending_42 + Client_Sending_43 + Client_Sending_44 + Client_Sending_45 + Client_Sending_46 + Client_Sending_47 + Client_Sending_48 + Client_Sending_49 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= RequestBufferSlots) OR ((Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_Sending_24 + Client_Sending_25 + Client_Sending_26 + Client_Sending_27 + Client_Sending_28 + Client_Sending_29 + Client_Sending_30 + Client_Sending_31 + Client_Sending_32 + Client_Sending_33 + Client_Sending_34 + Client_Sending_35 + Client_Sending_36 + Client_Sending_37 + Client_Sending_38 + Client_Sending_39 + Client_Sending_40 + Client_Sending_41 + Client_Sending_42 + Client_Sending_43 + Client_Sending_44 + Client_Sending_45 + Client_Sending_46 + Client_Sending_47 + Client_Sending_48 + Client_Sending_49 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_4_5 + Server_Anwering_4_6 + Server_Anwering_4_7 + Server_Anwering_49_1 + Server_Anwering_49_2 + Server_Anwering_49_3 + Server_Anwering_49_4 + Server_Anwering_49_5 + Server_Anwering_49_6 + Server_Anwering_49_7 + Server_Anwering_36_1 + Server_Anwering_36_2 + Server_Anwering_36_3 + Server_Anwering_36_4 + Server_Anwering_36_5 + Server_Anwering_36_6 + Server_Anwering_36_7 + Server_Anwering_23_1 + Server_Anwering_23_2 + Server_Anwering_23_3 + Server_Anwering_23_4 + Server_Anwering_23_5 + Server_Anwering_23_6 + Server_Anwering_23_7 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_10_5 + Server_Anwering_10_6 + Server_Anwering_10_7 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_5_5 + Server_Anwering_5_6 + Server_Anwering_5_7 + Server_Anwering_37_1 + Server_Anwering_37_2 + Server_Anwering_37_3 + Server_Anwering_37_4 + Server_Anwering_37_5 + Server_Anwering_37_6 + Server_Anwering_37_7 + Server_Anwering_24_1 + Server_Anwering_24_2 + Server_Anwering_24_3 + Server_Anwering_24_4 + Server_Anwering_24_5 + Server_Anwering_24_6 + Server_Anwering_24_7 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_11_5 + Server_Anwering_11_6 + Server_Anwering_11_7 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_6_5 + Server_Anwering_6_6 + Server_Anwering_6_7 + Server_Anwering_38_1 + Server_Anwering_38_2 + Server_Anwering_38_3 + Server_Anwering_38_4 + Server_Anwering_38_5 + Server_Anwering_38_6 + Server_Anwering_38_7 + Server_Anwering_25_1 + Server_Anwering_25_2 + Server_Anwering_25_3 + Server_Anwering_25_4 + Server_Anwering_25_5 + Server_Anwering_25_6 + Server_Anwering_25_7 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_12_5 + Server_Anwering_12_6 + Server_Anwering_12_7 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_7_5 + Server_Anwering_7_6 + Server_Anwering_7_7 + Server_Anwering_39_1 + Server_Anwering_39_2 + Server_Anwering_39_3 + Server_Anwering_39_4 + Server_Anwering_39_5 + Server_Anwering_39_6 + Server_Anwering_39_7 + Server_Anwering_26_1 + Server_Anwering_26_2 + Server_Anwering_26_3 + Server_Anwering_26_4 + Server_Anwering_26_5 + Server_Anwering_26_6 + Server_Anwering_26_7 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_13_5 + Server_Anwering_13_6 + Server_Anwering_13_7 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_8_5 + Server_Anwering_8_6 + Server_Anwering_8_7 + Server_Anwering_27_1 + Server_Anwering_27_2 + Server_Anwering_27_3 + Server_Anwering_27_4 + Server_Anwering_27_5 + Server_Anwering_27_6 + Server_Anwering_27_7 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_14_5 + Server_Anwering_14_6 + Server_Anwering_14_7 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_9_5 + Server_Anwering_9_6 + Server_Anwering_9_7 + Server_Anwering_28_1 + Server_Anwering_28_2 + Server_Anwering_28_3 + Server_Anwering_28_4 + Server_Anwering_28_5 + Server_Anwering_28_6 + Server_Anwering_28_7 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_15_5 + Server_Anwering_15_6 + Server_Anwering_15_7 + Server_Anwering_29_1 + Server_Anwering_29_2 + Server_Anwering_29_3 + Server_Anwering_29_4 + Server_Anwering_29_5 + Server_Anwering_29_6 + Server_Anwering_29_7 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_16_5 + Server_Anwering_16_6 + Server_Anwering_16_7 + Server_Anwering_35_7 + Server_Anwering_35_6 + Server_Anwering_35_5 + Server_Anwering_35_4 + Server_Anwering_35_3 + Server_Anwering_35_2 + Server_Anwering_35_1 + Server_Anwering_48_7 + Server_Anwering_48_6 + Server_Anwering_17_1 + Server_Anwering_17_2 + Server_Anwering_17_3 + Server_Anwering_17_4 + Server_Anwering_17_5 + Server_Anwering_17_6 + Server_Anwering_17_7 + Server_Anwering_40_1 + Server_Anwering_40_2 + Server_Anwering_40_3 + Server_Anwering_40_4 + Server_Anwering_40_5 + Server_Anwering_40_6 + Server_Anwering_40_7 + Server_Anwering_18_1 + Server_Anwering_18_2 + Server_Anwering_18_3 + Server_Anwering_18_4 + Server_Anwering_18_5 + Server_Anwering_18_6 + Server_Anwering_18_7 + Server_Anwering_41_1 + Server_Anwering_41_2 + Server_Anwering_41_3 + Server_Anwering_41_4 + Server_Anwering_41_5 + Server_Anwering_41_6 + Server_Anwering_41_7 + Server_Anwering_19_1 + Server_Anwering_19_2 + Server_Anwering_19_3 + Server_Anwering_19_4 + Server_Anwering_19_5 + Server_Anwering_19_6 + Server_Anwering_19_7 + Server_Anwering_42_1 + Server_Anwering_42_2 + Server_Anwering_42_3 + Server_Anwering_42_4 + Server_Anwering_42_5 + Server_Anwering_42_6 + Server_Anwering_42_7 + Server_Anwering_48_5 + Server_Anwering_48_4 + Server_Anwering_48_3 + Server_Anwering_48_2 + Server_Anwering_48_1 + Server_Anwering_3_7 + Server_Anwering_3_6 + Server_Anwering_3_5 + Server_Anwering_3_4 + Server_Anwering_3_3 + Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_21_7 + Server_Anwering_21_6 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Server_Anwering_34_7 + Server_Anwering_34_6 + Server_Anwering_34_5 + Server_Anwering_34_4 + Server_Anwering_34_3 + Server_Anwering_34_2 + Server_Anwering_34_1 + Server_Anwering_47_7 + Server_Anwering_47_6 + Server_Anwering_47_5 + Server_Anwering_47_4 + Server_Anwering_47_3 + Server_Anwering_47_2 + Server_Anwering_47_1 + Server_Anwering_43_1 + Server_Anwering_43_2 + Server_Anwering_43_3 + Server_Anwering_43_4 + Server_Anwering_43_5 + Server_Anwering_43_6 + Server_Anwering_43_7 + Server_Anwering_30_1 + Server_Anwering_30_2 + Server_Anwering_30_3 + Server_Anwering_30_4 + Server_Anwering_30_5 + Server_Anwering_30_6 + Server_Anwering_30_7 + Server_Anwering_44_1 + Server_Anwering_44_2 + Server_Anwering_44_3 + Server_Anwering_44_4 + Server_Anwering_44_5 + Server_Anwering_44_6 + Server_Anwering_44_7 + Server_Anwering_31_1 + Server_Anwering_31_2 + Server_Anwering_31_3 + Server_Anwering_31_4 + Server_Anwering_31_5 + Server_Anwering_31_6 + Server_Anwering_31_7 + Server_Anwering_45_1 + Server_Anwering_45_2 + Server_Anwering_45_3 + Server_Anwering_45_4 + Server_Anwering_45_5 + Server_Anwering_45_6 + Server_Anwering_45_7 + Server_Anwering_32_1 + Server_Anwering_32_2 + Server_Anwering_32_3 + Server_Anwering_32_4 + Server_Anwering_32_5 + Server_Anwering_32_6 + Server_Anwering_32_7 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_1_4 + Server_Anwering_1_5 + Server_Anwering_1_6 + Server_Anwering_1_7 + Server_Anwering_46_1 + Server_Anwering_46_2 + Server_Anwering_46_3 + Server_Anwering_46_4 + Server_Anwering_46_5 + Server_Anwering_46_6 + Server_Anwering_46_7 + Server_Anwering_33_1 + Server_Anwering_33_2 + Server_Anwering_33_3 + Server_Anwering_33_4 + Server_Anwering_33_5 + Server_Anwering_33_6 + Server_Anwering_33_7 + Server_Anwering_20_1 + Server_Anwering_20_2 + Server_Anwering_20_3 + Server_Anwering_20_4 + Server_Anwering_20_5 + Server_Anwering_20_6 + Server_Anwering_20_7 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_2_4 + Server_Anwering_2_5 + Server_Anwering_2_6 + Server_Anwering_2_7 + Server_Anwering_22_1 + Server_Anwering_22_2 + Server_Anwering_22_3 + Server_Anwering_22_4 + Server_Anwering_22_5 + Server_Anwering_22_6 + Server_Anwering_22_7) AND (3 <= RequestBufferSlots)) OR (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 + 1 <= Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)))) : A (G ((((3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) AND (3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))))) : A (G (())) : A (G ((Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_Sending_24 + Client_Sending_25 + Client_Sending_26 + Client_Sending_27 + Client_Sending_28 + Client_Sending_29 + Client_Sending_30 + Client_Sending_31 + Client_Sending_32 + Client_Sending_33 + Client_Sending_34 + Client_Sending_35 + Client_Sending_36 + Client_Sending_37 + Client_Sending_38 + Client_Sending_39 + Client_Sending_40 + Client_Sending_41 + Client_Sending_42 + Client_Sending_43 + Client_Sending_44 + Client_Sending_45 + Client_Sending_46 + Client_Sending_47 + Client_Sending_48 + Client_Sending_49 + Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_Sending_6 + Client_Sending_5 + Client_Sending_4 + Client_Sending_3 + Client_Sending_2 + Client_Sending_1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))) : A (G ((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_4_5 + Server_Anwering_4_6 + Server_Anwering_4_7 + Server_Anwering_49_1 + Server_Anwering_49_2 + Server_Anwe
ring_49_3 + Server_Anwering_49_4 + Server_Anwering_49_5 + Server_Anwering_49_6 + Server_Anwering_49_7 + Server_Anwering_36_1 + Server_Anwering_36_2 + Server_Anwering_36_3 + Server_Anwering_36_4 + Server_Anwering_36_5 + Server_Anwering_36_6 + Server_Anwering_36_7 + Server_Anwering_23_1 + Server_Anwering_23_2 + Server_Anwering_23_3 + Server_Anwering_23_4 + Server_Anwering_23_5 + Server_Anwering_23_6 + Server_Anwering_23_7 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_10_5 + Server_Anwering_10_6 + Server_Anwering_10_7 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_5_5 + Server_Anwering_5_6 + Server_Anwering_5_7 + Server_Anwering_37_1 + Server_Anwering_37_2 + Server_Anwering_37_3 + Server_Anwering_37_4 + Server_Anwering_37_5 + Server_Anwering_37_6 + Server_Anwering_37_7 + Server_Anwering_24_1 + Server_Anwering_24_2 + Server_Anwering_24_3 + Server_Anwering_24_4 + Server_Anwering_24_5 + Server_Anwering_24_6 + Server_Anwering_24_7 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_11_5 + Server_Anwering_11_6 + Server_Anwering_11_7 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_6_5 + Server_Anwering_6_6 + Server_Anwering_6_7 + Server_Anwering_38_1 + Server_Anwering_38_2 + Server_Anwering_38_3 + Server_Anwering_38_4 + Server_Anwering_38_5 + Server_Anwering_38_6 + Server_Anwering_38_7 + Server_Anwering_25_1 + Server_Anwering_25_2 + Server_Anwering_25_3 + Server_Anwering_25_4 + Server_Anwering_25_5 + Server_Anwering_25_6 + Server_Anwering_25_7 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_12_5 + Server_Anwering_12_6 + Server_Anwering_12_7 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_7_5 + Server_Anwering_7_6 + Server_Anwering_7_7 + Server_Anwering_39_1 + Server_Anwering_39_2 + Server_Anwering_39_3 + Server_Anwering_39_4 + Server_Anwering_39_5 + Server_Anwering_39_6 + Server_Anwering_39_7 + Server_Anwering_26_1 + Server_Anwering_26_2 + Server_Anwering_26_3 + Server_Anwering_26_4 + Server_Anwering_26_5 + Server_Anwering_26_6 + Server_Anwering_26_7 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_13_5 + Server_Anwering_13_6 + Server_Anwering_13_7 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_8_5 + Server_Anwering_8_6 + Server_Anwering_8_7 + Server_Anwering_27_1 + Server_Anwering_27_2 + Server_Anwering_27_3 + Server_Anwering_27_4 + Server_Anwering_27_5 + Server_Anwering_27_6 + Server_Anwering_27_7 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_14_5 + Server_Anwering_14_6 + Server_Anwering_14_7 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_9_5 + Server_Anwering_9_6 + Server_Anwering_9_7 + Server_Anwering_28_1 + Server_Anwering_28_2 + Server_Anwering_28_3 + Server_Anwering_28_4 + Server_Anwering_28_5 + Server_Anwering_28_6 + Server_Anwering_28_7 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_15_5 + Server_Anwering_15_6 + Server_Anwering_15_7 + Server_Anwering_29_1 + Server_Anwering_29_2 + Server_Anwering_29_3 + Server_Anwering_29_4 + Server_Anwering_29_5 + Server_Anwering_29_6 + Server_Anwering_29_7 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_16_5 + Server_Anwering_16_6 + Server_Anwering_16_7 + Server_Anwering_35_7 + Server_Anwering_35_6 + Server_Anwering_35_5 + Server_Anwering_35_4 + Server_Anwering_35_3 + Server_Anwering_35_2 + Server_Anwering_35_1 + Server_Anwering_48_7 + Server_Anwering_48_6 + Server_Anwering_17_1 + Server_Anwering_17_2 + Server_Anwering_17_3 + Server_Anwering_17_4 + Server_Anwering_17_5 + Server_Anwering_17_6 + Server_Anwering_17_7 + Server_Anwering_40_1 + Server_Anwering_40_2 + Server_Anwering_40_3 + Server_Anwering_40_4 + Server_Anwering_40_5 + Server_Anwering_40_6 + Server_Anwering_40_7 + Server_Anwering_18_1 + Server_Anwering_18_2 + Server_Anwering_18_3 + Server_Anwering_18_4 + Server_Anwering_18_5 + Server_Anwering_18_6 + Server_Anwering_18_7 + Server_Anwering_41_1 + Server_Anwering_41_2 + Server_Anwering_41_3 + Server_Anwering_41_4 + Server_Anwering_41_5 + Server_Anwering_41_6 + Server_Anwering_41_7 + Server_Anwering_19_1 + Server_Anwering_19_2 + Server_Anwering_19_3 + Server_Anwering_19_4 + Server_Anwering_19_5 + Server_Anwering_19_6 + Server_Anwering_19_7 + Server_Anwering_42_1 + Server_Anwering_42_2 + Server_Anwering_42_3 + Server_Anwering_42_4 + Server_Anwering_42_5 + Server_Anwering_42_6 + Server_Anwering_42_7 + Server_Anwering_48_5 + Server_Anwering_48_4 + Server_Anwering_48_3 + Server_Anwering_48_2 + Server_Anwering_48_1 + Server_Anwering_3_7 + Server_Anwering_3_6 + Server_Anwering_3_5 + Server_Anwering_3_4 + Server_Anwering_3_3 + Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_21_7 + Server_Anwering_21_6 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Server_Anwering_34_7 + Server_Anwering_34_6 + Server_Anwering_34_5 + Server_Anwering_34_4 + Server_Anwering_34_3 + Server_Anwering_34_2 + Server_Anwering_34_1 + Server_Anwering_47_7 + Server_Anwering_47_6 + Server_Anwering_47_5 + Server_Anwering_47_4 + Server_Anwering_47_3 + Server_Anwering_47_2 + Server_Anwering_47_1 + Server_Anwering_43_1 + Server_Anwering_43_2 + Server_Anwering_43_3 + Server_Anwering_43_4 + Server_Anwering_43_5 + Server_Anwering_43_6 + Server_Anwering_43_7 + Server_Anwering_30_1 + Server_Anwering_30_2 + Server_Anwering_30_3 + Server_Anwering_30_4 + Server_Anwering_30_5 + Server_Anwering_30_6 + Server_Anwering_30_7 + Server_Anwering_44_1 + Server_Anwering_44_2 + Server_Anwering_44_3 + Server_Anwering_44_4 + Server_Anwering_44_5 + Server_Anwering_44_6 + Server_Anwering_44_7 + Server_Anwering_31_1 + Server_Anwering_31_2 + Server_Anwering_31_3 + Server_Anwering_31_4 + Server_Anwering_31_5 + Server_Anwering_31_6 + Server_Anwering_31_7 + Server_Anwering_45_1 + Server_Anwering_45_2 + Server_Anwering_45_3 + Server_Anwering_45_4 + Server_Anwering_45_5 + Server_Anwering_45_6 + Server_Anwering_45_7 + Server_Anwering_32_1 + Server_Anwering_32_2 + Server_Anwering_32_3 + Server_Anwering_32_4 + Server_Anwering_32_5 + Server_Anwering_32_6 + Server_Anwering_32_7 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_1_3 + Server_Anwering_1_4 + Server_Anwering_1_5 + Server_Anwering_1_6 + Server_Anwering_1_7 + Server_Anwering_46_1 + Server_Anwering_46_2 + Server_Anwering_46_3 + Server_Anwering_46_4 + Server_Anwering_46_5 + Server_Anwering_46_6 + Server_Anwering_46_7 + Server_Anwering_33_1 + Server_Anwering_33_2 + Server_Anwering_33_3 + Server_Anwering_33_4 + Server_Anwering_33_5 + Server_Anwering_33_6 + Server_Anwering_33_7 + Server_Anwering_20_1 + Server_Anwering_20_2 + Server_Anwering_20_3 + Server_Anwering_20_4 + Server_Anwering_20_5 + Server_Anwering_20_6 + Server_Anwering_20_7 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_2_3 + Server_Anwering_2_4 + Server_Anwering_2_5 + Server_Anwering_2_6 + Server_Anwering_2_7 + Server_Anwering_22_1 + Server_Anwering_22_2 + Server_Anwering_22_3 + Server_Anwering_22_4 + Server_Anwering_22_5 + Server_Anwering_22_6 + Server_Anwering_22_7 <= 1))) : E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= 1) OR ((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + Client_Waiting_38 + Client_Waiting_37 + Client_Waiting_36 + Client_Waiting_35 + Client_Waiting_34 + Client_Waiting_33 + Client_Waiting_32 + Client_Waiting_31 + Client_Waiting_30 + Client_Waiting_29 + Client_Waiting_28 + Client_Waiting_27 + Client_Waiting_26 + Client_Waiting_25 + Client_Waiting_24 + Client_Waiting_23 + Client_Waiting_22 + Client_Waiting_21 + Client_Waiting_20 + Client_Waiting_19 + Client_Waiting_18 + Client_Waiting_17 + Client_Waiting_16 + Client_Waiting_15 + Client_Waiting_14 + Client_Waiting_13 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10) AND (RequestBufferSlots <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + RequestBuffer_22 + RequestBuffer_23 + RequestBuffer_24 + RequestBuffer_25 + RequestBuffer_26 + RequestBuffer_27 + RequestBuffer_28 + RequestBuffer_29 + RequestBuffer_30 + RequestBuffer_31 + RequestBuffer_32 + RequestBuffer_33 + RequestBuffer_34 + RequestBuffer_35 + RequestBuffer_36 + RequestBuffer_37 + RequestBuffer_38 + RequestBuffer_39 + RequestBuffer_40 + RequestBuffer_41 + RequestBuffer_42 + RequestBuffer_43 + RequestBuffer_44 + RequestBuffer_45 + RequestBuffer_46 + RequestBuffer_47 + RequestBuffer_48 + RequestBuffer_49) AND ((2 <= Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 + RequestBuffer_10 + RequestBuffer_11 + RequestBuffer_12 + RequestBuffer_13 + RequestBuffer_14 + RequestBuffer_15 + RequestBuffer_16 + RequestBuffer_17 + RequestBuffer_18 + RequestBuffer_19 + RequestBuffer_20 + RequestBuffer_21 + RequestBuffer_22 + RequestBuffer_23 + RequestBuffer_24 + RequestBuffer_25 + RequestBuffer_26 + RequestBuffer_27 + RequestBuffer_28 + RequestBuffer_29 + RequestBuffer_30 + RequestBuffer_31 + RequestBuffer_32 + RequestBuffer_33 + RequestBuffer_34 + RequestBuffer_35 + RequestBuffer_36 + RequestBuffer_37 + RequestBuffer_38 + RequestBuffer_39 + RequestBuffer_40 + RequestBuffer_41 + RequestBuffer_42 + RequestBuffer_43 + RequestBuffer_44 + RequestBuffer_45 + RequestBuffer_46 + RequestBuffer_47 + RequestBuffer_48 + RequestBuffer_49)))))) : E (F (((RequestBuffer_39 <= 1) AND (Server_Anwering_35_5 + 1 <= Server_Anwering_46_1) AND (Server_Anwering_43_7 + 1 <= Server_Anwering_9_5)))) : E (F ((3 <= Client_Waiting_26))) : E (F (((Server_Anwering_33_3 <= Server_Anwering_2_5) AND (3 <= RequestBuffer_47)))) : E (F ((3 <= Server_Anwering_7_3))) : A (G ((((3 <= Server_Anwering_19_2) AND (1 <= Server_Anwering_11_7)) OR (Client_Sending_44 <= Server_Anwering_34_3) OR (Server_Anwering_4_6 <= Server_Anwering_8_5)))) : E (F ((2 <= Server_Anwering_35_4))) : E (F ((((Client_Waiting_21 + 1 <= Server_Anwering_6_6) AND (RequestBuffer_1 + 1 <= RequestBuffer_34)) OR (1 <= Server_Anwering_45_4)))) : E (F ((((Server_Anwering_35_2 <= Server_Anwering_27_7) OR (1 <= Server_Anwering_15_4) OR ((Server_Anwering_39_6 <= Client_Waiting_9) AND (2 <= Client_Sending_9))) AND (3 <= Server_Anwering_16_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 498 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-07-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_W... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Server_Waiting_7 + Server_Waiting_6 + Server_Waiting_5 + Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1) OR (Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 73 markings, 88 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 498 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-07-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + Client_Sending_17 + Client_Sending_18 + Client_Sending_19 + Client_Sending_20 + Client_Sending_21 + Client_Sending_22 + Client_Sending_23 + Client_Sending_24 + Client_Sending_25 + Client_Sending_26 + Client_Sending_27 + Client_Sending_28 + Client_Sendin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: lola: result: nostate equation: calling and running sara

lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_4_5 + Server_Anwering_4_6 + Server_Anwering_4_7 + Server_Anwering_49_1 + Server_Anwering_49_2 + Server_Anwering_49_3 + Server_Anwering_49_4 + Server_Anwering_49_5 + Server_Anwering_49_6 + Server_Anwering_49_7 + Server_Anwering_36_1 + Server_Anwering_36_2 + Server_Anwering_36_3 + Server_An... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 6 edges
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-6.sara
lola: ========================================
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-5.sara.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Waiting_5 + Client_Waiting_6 + Client_Waiting_7 + Client_Waiting_8 + Client_Waiting_9 + Client_Waiting_49 + Client_Waiting_48 + Client_Waiting_47 + Client_Waiting_46 + Client_Waiting_45 + Client_Waiting_44 + Client_Waiting_43 + Client_Waiting_42 + Client_Waiting_41 + Client_Waiting_40 + Client_Waiting_39 + C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((RequestBuffer_39 <= 1) AND (Server_Anwering_35_5 + 1 <= Server_Anwering_46_1) AND (Server_Anwering_43_7 + 1 <= Server_Anwering_9_5))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Client_Waiting_26)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Server_Anwering_33_3 <= Server_Anwering_2_5) AND (3 <= RequestBuffer_47))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-10.sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Server_Anwering_7_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-11.sara
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= Server_Anwering_19_2) AND (1 <= Server_Anwering_11_7)) OR (Client_Sending_44 <= Server_Anwering_34_3) OR (Server_Anwering_4_6 <= Server_Anwering_8_5))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara14 markings, 15 edges

lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= Server_Anwering_35_4)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-12.sara.
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Client_Waiting_21 + 1 <= Server_Anwering_6_6) AND (RequestBuffer_1 + 1 <= RequestBuffer_34)) OR (1 <= Server_Anwering_45_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((Server_Anwering_35_2 <= Server_Anwering_27_7) OR (1 <= Server_Anwering_15_4) OR ((Server_Anwering_39_6 <= Client_Waiting_9) AND (2 <= Client_Sending_9))) AND (3 <= Server_Anwering_16_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1768 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-14.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-07-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-07-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes yes no yes no no no yes no
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-07-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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="CSRepetitions-PT-07"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
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/CSRepetitions-PT-07.tgz
mv CSRepetitions-PT-07 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 mcc4mcc-structural"
echo " Input is CSRepetitions-PT-07, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r035-ebro-152646315500467"
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 ;