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 668K
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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 12K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K 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 33K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K 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 151K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362700129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527461218157

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-04 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ CSRepetitions-PT-04 @ 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: 293/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3744
lola: finding significant places
lola: 117 places, 176 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 273 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-04-LTLCardinality.task
lola: A ((1 <= RequestBufferSlots)) : A (X (G (((1 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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) U (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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_4 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_3_4))))) : A ((F ((3 <= 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)) U G ((RequestBufferSlots <= 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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)))) : A (X ((G ((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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_4 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_3_4)) U (3 <= 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)))) : A (((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_4 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_3_4) U X (F ((3 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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))))) : A (X ((G ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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)) U X ((3 <= RequestBufferSlots))))) : A ((G (G ((Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10))) U G (X ((1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_6_4 + Server_Anwering_12_1 + Server_Anwering_12_2 + Server_Anwering_12_3 + Server_Anwering_12_4 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_7_4 + Server_Anwering_13_1 + Server_Anwering_13_2 + Server_Anwering_13_3 + Server_Anwering_13_4 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_8_4 + Server_Anwering_14_1 + Server_Anwering_14_2 + Server_Anwering_14_3 + Server_Anwering_14_4 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_9_4 + Server_Anwering_15_1 + Server_Anwering_15_2 + Server_Anwering_15_3 + Server_Anwering_15_4 + Server_Anwering_16_1 + Server_Anwering_16_2 + Server_Anwering_16_3 + Server_Anwering_16_4 + Server_Anwering_2_4 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_4 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 + Server_Anwering_3_4))))) : A (G (X ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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)))) : A (G ((Client_Waiting_4 <= RequestBufferSlots))) : A ((Server_Anwering_7_3 <= Server_Anwering_1_3)) : A (G ((RequestBuffer_13 <= RequestBuffer_7))) : A (F (G (F (G ((RequestBuffer_8 <= Server_Anwering_1_4)))))) : A (X (X (X (G ((Server_Anwering_7_4 <= Server_Anwering_6_2)))))) : A (F (X (X (X ((Client_Sending_6 <= Server_Anwering_8_3)))))) : A (X (X (((RequestBuffer_7 <= Server_Anwering_2_3) U (Server_Anwering_5_1 <= Server_Anwering_10_4))))) : A (G (F ((Server_Anwering_14_1 <= Client_Sending_13))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= RequestBufferSlots)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= RequestBufferSlots)
lola: processed formula length: 25
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-0 TRUE 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: (Server_Anwering_7_3 <= Server_Anwering_1_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Anwering_7_3 <= Server_Anwering_1_3)
lola: processed formula length: 44
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-9 TRUE 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: A (X (((3 <= 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) OR (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Wa... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((3 <= 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) OR (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 + Client_Wa... (shortened)
lola: processed formula length: 2374
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 219 markings, 221 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Server_A... (shortened)
lola: processed formula length: 1772
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2014 markings, 3607 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= RequestBufferSlots)) OR (G ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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)) AND X (F ((3 <= RequestBufferSlots)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= RequestBufferSlots)) OR (G ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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)) AND X (F ((3 <= RequestBufferSlots)))))... (shortened)
lola: processed formula length: 402
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 441 markings, 800 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Se... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((1 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_4_4 + Server_Anwering_10_1 + Server_Anwering_10_2 + Server_Anwering_10_3 + Server_Anwering_10_4 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_5_4 + Server_Anwering_11_1 + Server_Anwering_11_2 + Server_Anwering_11_3 + Server_Anwering_11_4 + Server_Anwering_6_1 + Se... (shortened)
lola: processed formula length: 3539
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 74 markings, 75 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending_14 + Client_Sending_15 + Client_Sending_16 + 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))))
lola: processed formula length: 327
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 73 markings, 73 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_A... (shortened)
lola: processed formula length: 3838
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11105 markings, 44695 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((Server_Anwering_7_4 <= Server_Anwering_6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((Server_Anwering_7_4 <= Server_Anwering_6_2))))))
lola: processed formula length: 64
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 271515 markings, 1222595 edges

FORMULA CSRepetitions-PT-04-LTLCardinality-12 FALSE 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: A (X (X (X (F ((Client_Sending_6 <= Server_Anwering_8_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((Client_Sending_6 <= Server_Anwering_8_3))))))
lola: processed formula length: 61
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 89 markings, 89 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((RequestBuffer_7 <= Server_Anwering_2_3) U (Server_Anwering_5_1 <= Server_Anwering_10_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((RequestBuffer_7 <= Server_Anwering_2_3) U (Server_Anwering_5_1 <= Server_Anwering_10_4)))))
lola: processed formula length: 102
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 153 markings, 272 edges
lola:
========================================FORMULA CSRepetitions-PT-04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((RequestBuffer_13 <= RequestBuffer_7)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((RequestBuffer_13 <= RequestBuffer_7)))
lola: processed formula length: 45
lola: 20 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RequestBuffer_7 + 1 <= RequestBuffer_13)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to CSRepetitions-PT-04-LTLCardinality-11-0.sara
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Client_Waiting_4 <= RequestBufferSlots)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: sara: try reading problem file CSRepetitions-PT-04-LTLCardinality-11-0.sara.
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Client_Waiting_4 <= RequestBufferSlots)))
lola: processed formula length: 48
lola: 20 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (RequestBufferSlots + 1 <= Client_Waiting_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-04-LTLCardinality-12-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola:
========================================FORMULA CSRepetitions-PT-04-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((RequestBuffer_8 <= Server_Anwering_1_4))))
lola: ========================================
lola: SUBTASK
lola: sara: place or transition ordering is non-deterministic
checking LTL
sara: try reading problem file CSRepetitions-PT-04-LTLCardinality-12-0.sara.
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((RequestBuffer_8 <= Server_Anwering_1_4))))
lola: processed formula length: 52
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola:
using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 102782 markings, 183134 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Server_Anwering_14_1 <= Client_Sending_13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Server_Anwering_14_1 <= Client_Sending_13))))
lola: processed formula length: 55
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 700 markings, 1117 edges
lola:
FORMULA CSRepetitions-PT-04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= 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)) U G ((RequestBufferSlots <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= 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)) U G ((RequestBufferSlots <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_... (shortened)
lola: processed formula length: 648
lola: 18 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4509 markings, 20822 edges
lola: ========================================

FORMULA CSRepetitions-PT-04-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no yes no no no no yes no
lola:
preliminary result: yes no no no no yes no no no yes no no no no yes no
lola: memory consumption: 19972 KB
lola: time consumption: 10 seconds

BK_STOP 1527461228405

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

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-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-04.tgz
mv CSRepetitions-PT-04 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 lola"
echo " Input is CSRepetitions-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r220-ebro-152732362700129"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;