About the Execution of 2018-Gold for CSRepetitions-PT-04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
167.060 | 1359.00 | 1075.00 | 17.40 | FFTTFFFFTFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r033-smll-155225133600026.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r033-smll-155225133600026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 20K Feb 9 08:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 9 08:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 5 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 119K Feb 5 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 7.1K Feb 4 23:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 4 23:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 2 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 2 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Jan 29 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jan 29 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 151K Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of 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 1552291206440
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 ((G (G ((Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_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 G (G ((2 <= Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1))))) : A (G ((G ((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_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_12 + Client_Waiting_11 + Client_Waiting_10)) U X ((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 <= RequestBufferSlots))))) : A ((F (F ((2 <= RequestBufferSlots))) U (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 <= Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1))) : A (X (X ((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 <= 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 ((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)) : A ((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 (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 (G (G (G (F ((RequestBufferSlots <= 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 ((Server_Anwering_14_1 <= Server_Anwering_5_2)) : A (G ((Client_Waiting_4 <= RequestBuffer_3))) : A (G (X ((Client_Waiting_15 <= Server_Anwering_3_3)))) : A ((Client_Waiting_16 <= Server_Anwering_3_3)) : A (X (G ((Server_Anwering_15_1 <= Client_Sending_12)))) : A (G (F (((Server_Anwering_7_3 <= Server_Anwering_15_1) U (Client_Sending_12 <= RequestBuffer_2))))) : A (F (F (F ((Server_Anwering_8_2 <= Server_Anwering_10_1))))) : A (G (G ((Server_Anwering_6_1 <= Server_Anwering_14_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (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)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (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)
lola: processed formula length: 315
lola: 17 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: processed formula with 1 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: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-4 FALSE 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: (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 initial satisfaction
lola: processed formula: (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: 315
lola: 17 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: processed formula with 1 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: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-5 FALSE 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: (Server_Anwering_14_1 <= Server_Anwering_5_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Anwering_14_1 <= Server_Anwering_5_2)
lola: processed formula length: 45
lola: 17 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-8 TRUE 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: (Client_Waiting_16 <= Server_Anwering_3_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Client_Waiting_16 <= Server_Anwering_3_3)
lola: processed formula length: 42
lola: 17 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: processed formula with 1 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: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-11 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 (G ((X ((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 <= RequestBufferSlots)) OR (G ((Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((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 <= RequestBufferSlots)) OR (G ((Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_... (shortened)
lola: processed formula length: 1056
lola: 17 rewrites
lola: closed formula file CSRepetitions-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 95 markings, 95 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Client_Waiting_15 <= Server_Anwering_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Client_Waiting_15 <= Server_Anwering_3_3))))
lola: processed formula length: 54
lola: 17 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-10 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 (X ((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 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((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 <= Client_Sending_10 + Client_Sending_11 + Client_Sending_12 + Client_Sending_13 + Client_Sending... (shortened)
lola: processed formula length: 618
lola: 17 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-3 TRUE 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 ((Server_Anwering_15_1 <= Client_Sending_12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Server_Anwering_15_1 <= Client_Sending_12))))
lola: processed formula length: 55
lola: 17 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: 4918 markings, 22332 edges
lola: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Client_Waiting_4 <= RequestBuffer_3)))
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 ((Client_Waiting_4 <= RequestBuffer_3)))
lola: processed formula length: 45
lola: 19 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Anwering_6_1 <= Server_Anwering_14_1)))
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 ((Server_Anwering_6_1 <= Server_Anwering_14_1)))
lola: processed formula length: 53
lola: 19 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Server_Anwering_14_1 + 1 <= Server_Anwering_6_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-04-LTLCardinality-9-0.sara
lola: ========================================
FORMULA CSRepetitions-PT-04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Server_Anwering_8_2 <= Server_Anwering_10_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Server_Anwering_10_1 + 1 <= Server_Anwering_8_2)
lola: processed formula length: 49
lola: 19 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (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)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (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 <= 2)
lola: processed formula length: 315
lola: 19 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 306 markings, 324 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 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Client_Sending_12 <= RequestBuffer_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Client_Sending_12 <= RequestBuffer_2))))
lola: processed formula length: 50
lola: 17 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: 30 markings, 30 edges
FORMULA CSRepetitions-PT-04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((RequestBufferSlots <= 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 (G (F ((RequestBufferSlots <= 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: 344
lola: 17 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: 23 markings, 23 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 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((2 <= Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) OR (G ((Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_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_Sen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((2 <= Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) OR (G ((Server_Waiting_4 + Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_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_Sen... (shortened)
lola: processed formula length: 580
lola: 17 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: 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: 87 markings, 159 edges
lola:
FORMULA CSRepetitions-PT-04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= RequestBufferSlots)) U (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 + Ser... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((2 <= RequestBufferSlots)) U (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 + Ser... (shortened)
lola: processed formula length: 1550
lola: 17 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola:
FORMULA CSRepetitions-PT-04-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no no no yes no no no no no yes no
lola:
preliminary result: no no yes yes no no no no yes no no no no no yes no
========================================
lola: memory consumption: 19248 KB
lola: time consumption: 1 seconds
BK_STOP 1552291207799
--------------------
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="win2018"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
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 r033-smll-155225133600026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-04.tgz
mv CSRepetitions-PT-04 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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 '
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 ;