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-155225133600023.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-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r033-smll-155225133600023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 17K Feb 9 08:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 9 08:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 5 06:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 5 06:49 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 5.4K Feb 4 23:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 23:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 2 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 2 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jan 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Jan 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 71K 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-03-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552291152474

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-03 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ CSRepetitions-PT-03 @ 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: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 127 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-03-LTLCardinality.task
lola: A ((1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)) : A (G (F (G (X ((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))))) : A ((Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3 <= RequestBufferSlots)) : A (G ((X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1)) U (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))) : A (F (G (((1 <= RequestBufferSlots) U (Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 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 (F (F ((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_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Server_Anwering_2_3 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_3 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_3_1 + Server_Anwering_3_2 + Server_Anwering_3_3)))))) : A (F (X (X (X ((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)))))) : A (G (X ((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)))) : A ((G (F ((Server_Anwering_5_2 <= Server_Anwering_7_1))) U (Client_Waiting_5 <= Server_Anwering_1_1))) : A (G ((RequestBuffer_7 <= Server_Anwering_8_3))) : A ((Server_Waiting_3 <= Client_Waiting_2)) : A ((Server_Anwering_5_3 <= RequestBuffer_7)) : A (F (F (((RequestBuffer_6 <= Client_Sending_5) U (RequestBuffer_5 <= Client_Waiting_7))))) : A (X (G (G (F ((RequestBufferSlots <= Server_Anwering_5_2)))))) : A (X (F (F (F ((Server_Anwering_4_3 <= Server_Anwering_9_1)))))) : A (G (X (F (G ((Client_Sending_8 <= Server_Anwering_8_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)
lola: processed formula length: 166
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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-03-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Ser... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_4_3 + Server_Anwering_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 + Server_Anwering_7_2 + Server_Anwering_7_3 + Server_Anwering_8_1 + Server_Anwering_8_2 + Server_Anwering_8_3 + Server_Anwering_9_1 + Server_Anwering_9_2 + Server_Anwering_9_3 + Ser... (shortened)
lola: processed formula length: 615
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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-03-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Server_Waiting_3 <= Client_Waiting_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Waiting_3 <= Client_Waiting_2)
lola: processed formula length: 38
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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-03-LTLCardinality-10 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: (Server_Anwering_5_3 <= RequestBuffer_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Server_Anwering_5_3 <= RequestBuffer_7)
lola: processed formula length: 40
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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-03-LTLCardinality-11 TRUE 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 (G ((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))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((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))))
lola: processed formula length: 354
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 52 markings, 52 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLCardinality-7 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 (G (F ((1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9)))) AND A (G ((X ((RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9 <= Server_Waiting_3 + Server_Waiting_2 + Serv... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))))
lola: processed formula length: 178
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 255 markings, 327 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola:
FORMULA CSRepetitions-PT-03-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((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))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((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))))))
lola: processed formula length: 195
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 256 markings, 531 edges
lola:
========================================
FORMULA CSRepetitions-PT-03-LTLCardinality-6 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 (F ((Server_Anwering_4_3 <= Server_Anwering_9_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Server_Anwering_4_3 <= Server_Anwering_9_1))))
lola: processed formula length: 56
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 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: 10 markings, 9 edges
lola:
FORMULA CSRepetitions-PT-03-LTLCardinality-14 TRUE 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 ((RequestBuffer_7 <= Server_Anwering_8_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 ((RequestBuffer_7 <= Server_Anwering_8_3)))
lola: processed formula length: 48
lola: 30 rewrites
lola: closed formula file CSRepetitions-PT-03-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: (Server_Anwering_8_3 + 1 <= RequestBuffer_7)
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: 4 markings, 3 edges
lola: state equation: write sara problem file to CSRepetitions-PT-03-LTLCardinality-8-0.sara

FORMULA CSRepetitions-PT-03-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((RequestBuffer_5 <= Client_Waiting_7)))
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_Waiting_7 + 1 <= RequestBuffer_5)
lola: processed formula length: 41
lola: 30 rewrites
lola: closed formula file CSRepetitions-PT-03-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

FORMULA CSRepetitions-PT-03-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((RequestBufferSlots <= Server_Anwering_5_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((RequestBufferSlots <= Server_Anwering_5_2))))
lola: processed formula length: 55
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 29 markings, 29 edges
lola: sara: try reading problem file CSRepetitions-PT-03-LTLCardinality-8-0.sara.

FORMULA CSRepetitions-PT-03-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Client_Sending_8 <= Server_Anwering_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Client_Sending_8 <= Server_Anwering_8_1))))
lola: processed formula length: 53
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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, 24 edges
lola:
FORMULA CSRepetitions-PT-03-LTLCardinality-15 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 (((Client_Waiting_5 <= Server_Anwering_1_1) OR (G (F ((Server_Anwering_5_2 <= Server_Anwering_7_1))) AND F ((Client_Waiting_5 <= Server_Anwering_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Client_Waiting_5 <= Server_Anwering_1_1) OR (G (F ((Server_Anwering_5_2 <= Server_Anwering_7_1))) AND F ((Client_Waiting_5 <= Server_Anwering_1_1)))))
lola: processed formula length: 155
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLCardinality.task
sara: place or transition ordering is non-deterministic
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: 21 markings, 21 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 + RequestBuffer_5 + RequestBuffer_6 + RequestBuffer_7 + RequestBuffer_8 + RequestBuffer_9))))
lola: processed formula length: 178
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 39 markings, 46 edges
lola:
FORMULA CSRepetitions-PT-03-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 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 ((1 <= RequestBufferSlots) OR (Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= 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 ((1 <= RequestBufferSlots) OR (Server_Waiting_3 + Server_Waiting_2 + Server_Waiting_1 <= Client_Sending_9 + Client_Sending_8 + Client_Sending_7 + Client_... (shortened)
lola: processed formula length: 510
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 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: 217043 markings, 613027 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLCardinality-4 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 (G (F ((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_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((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_5_1 + Server_Anwering_5_2 + Server_Anwering_5_3 + Server_Anwering_6_1 + Server_Anwering_6_2 + Server_Anwering_6_3 + Server_Anwering_7_1 ... (shortened)
lola: processed formula length: 777
lola: 28 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 67 markings, 67 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no no no yes yes yes no yes no
lola:
preliminary result: no no yes no no no yes no no no yes yes yes no yes no
lola: memory consumption: 18748 KB
lola: time consumption: 1 seconds

BK_STOP 1552291153944

--------------------
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-03"
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-03, 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-155225133600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-03.tgz
mv CSRepetitions-PT-03 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 '' 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 ;