fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r121-smll-155272326200119
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
217.940 393731.00 396861.00 791.80 FFFTFFTFTTTTFFFF 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.r121-smll-155272326200119.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 PolyORBLF-PT-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326200119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 8.3K Feb 12 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 12 09:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 8 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 8 09:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.6K Feb 5 00:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 5 00:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 4 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 4 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 1 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 1 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:23 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.4M Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1553000233901

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-PT-S06J04T04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-PT-S06J04T04 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J04T04 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T04-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= DisablePollingB_4_5 + DisablePollingB_4_4 + DisablePollingB_4_3 + DisablePollingB_4_2 + DisablePollingB_4_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_1_3 + DisablePollingB_1_4 + DisablePollingB_1_5 + DisablePollingB_1_6 + DisablePollingB_3_6 + DisablePollingB_3_5 + DisablePollingB_3_4 + DisablePollingB_3_3 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_2_1 + DisablePollingB_2_2 + DisablePollingB_2_3 + DisablePollingB_2_4 + DisablePollingB_2_5 + DisablePollingB_2_6 + DisablePollingB_4_6)
lola: LP says that atomic proposition is always false: (2 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4)
lola: LP says that atomic proposition is always false: (3 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4)
lola: LP says that atomic proposition is always false: (3 <= MarkerWrite)
lola: LP says that atomic proposition is always false: (cBlockedTasks <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4)
lola: A ((F (G ((1 <= P_1093))) U F (X (FALSE)))) : A ((3 <= cIdleTasks)) : A (G ((X ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)) U (1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4)))) : A ((G (G (FALSE)) U (1 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1))) : A (F (F (G (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort)))))) : A (X ((G (FALSE) U G (FALSE)))) : A ((Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 <= cIsMonitoring)) : A (F ((F (FALSE) U (BlockedTasks <= P_1727)))) : A ((ScheduleTaskE_Check_4 <= P_1617_3)) : A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1))) : A ((DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)) : A ((NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)) : A (G ((ScheduleTaskE_Check_4 <= RunE_3))) : A ((G (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3))) U G (G ((DisablePollingB_3_1 <= DataOnSrc_6))))) : A (F (G (G (G ((P_1724_1 <= nyo_1)))))) : A (F (X (G (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 211 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= cIdleTasks)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= cIdleTasks)
lola: processed formula length: 17
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1)
lola: processed formula length: 60
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Ins... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Ins... (shortened)
lola: processed formula length: 544
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ScheduleTaskE_Check_4 <= P_1617_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Check_4 <= P_1617_3)
lola: processed formula length: 35
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DisablePollingB_1_3 <= NotifyEventJobQueuedB_3_4)
lola: processed formula length: 50
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventJobQueuedE_3 <= NotifyEventEndOfCheckSourcesE_3)
lola: processed formula length: 60
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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 PolyORBLF-PT-S06J04T04-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4)))) AND A (G ((X ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4)) OR (1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4))))
lola: processed formula length: 112
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 6677 markings, 11007 edges, 1335 markings/sec, 0 secs
lola: 14388 markings, 24801 edges, 1542 markings/sec, 5 secs
lola: 21391 markings, 37557 edges, 1401 markings/sec, 10 secs
lola: 28941 markings, 50975 edges, 1510 markings/sec, 15 secs
lola: 36539 markings, 65154 edges, 1520 markings/sec, 20 secs
lola: 43466 markings, 78990 edges, 1385 markings/sec, 25 secs
lola: 50352 markings, 91954 edges, 1377 markings/sec, 30 secs
lola: 57009 markings, 105976 edges, 1331 markings/sec, 35 secs
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: 59341 markings, 112576 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola:
FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((TryAllocateOneTaskE_1 <= NotifyEventJobCompletedE_1))) U (P_1617_3 <= P_1617_1)))
lola: processed formula length: 92
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 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 PolyORBLF-PT-S06J04T04-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((ScheduleTaskE_Check_4 <= RunE_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 ((ScheduleTaskE_Check_4 <= RunE_3)))
lola: processed formula length: 41
lola: 43 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: (RunE_3 + 1 <= ScheduleTaskE_Check_4)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T04-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T04-LTLCardinality-10-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((BlockedTasks <= P_1727)))
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: (P_1727 + 1 <= BlockedTasks)
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 5241 markings, 16635 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P_1724_1 <= nyo_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P_1724_1 <= nyo_1))))
lola: processed formula length: 31
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 8676 markings, 17817 edges, 1735 markings/sec, 0 secs
lola: 17154 markings, 35739 edges, 1696 markings/sec, 5 secs
lola: 26426 markings, 54263 edges, 1854 markings/sec, 10 secs
lola: 35606 markings, 72670 edges, 1836 markings/sec, 15 secs
lola: 45548 markings, 90680 edges, 1988 markings/sec, 20 secs
lola: 56306 markings, 110729 edges, 2152 markings/sec, 25 secs
lola: 67941 markings, 130490 edges, 2327 markings/sec, 30 secs
lola: 78272 markings, 148112 edges, 2066 markings/sec, 35 secs
lola: 89233 markings, 166727 edges, 2192 markings/sec, 40 secs
lola: 100716 markings, 184971 edges, 2297 markings/sec, 45 secs
lola: 111573 markings, 203587 edges, 2171 markings/sec, 50 secs
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: 121228 markings, 217508 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1094 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ScheduleTaskE_Work_3_2 <= DisablePollingB_2_6))))
lola: processed formula length: 59
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 7563 markings, 15595 edges, 1513 markings/sec, 0 secs
lola: 15778 markings, 32907 edges, 1643 markings/sec, 5 secs
lola: 24580 markings, 50739 edges, 1760 markings/sec, 10 secs
lola: 34290 markings, 69493 edges, 1942 markings/sec, 15 secs
lola: 43730 markings, 87951 edges, 1888 markings/sec, 20 secs
lola: 53761 markings, 105950 edges, 2006 markings/sec, 25 secs
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: 59117 markings, 115263 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((DisablePollingB_3_1 <= DataOnSrc_6)) OR (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3)) AND F (G ((DisablePollingB_3_1 <= DataOnSrc_6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((DisablePollingB_3_1 <= DataOnSrc_6)) OR (G ((P_2579_1_6 <= ScheduleTaskE_Work_2_3)) AND F (G ((DisablePollingB_3_1 <= DataOnSrc_6))))))
lola: processed formula length: 143
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 9422 markings, 19679 edges, 1884 markings/sec, 0 secs
lola: 18515 markings, 38279 edges, 1819 markings/sec, 5 secs
lola: 28417 markings, 58241 edges, 1980 markings/sec, 10 secs
lola: 37967 markings, 77098 edges, 1910 markings/sec, 15 secs
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: 48639 markings, 98041 edges

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 <= SigAbort))))
lola: processed formula length: 67
lola: 41 rewrites
lola: closed formula file PolyORBLF-PT-S06J04T04-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: 8236 markings, 16811 edges, 1647 markings/sec, 0 secs
lola: 16632 markings, 34400 edges, 1679 markings/sec, 5 secs
lola: 25479 markings, 51963 edges, 1769 markings/sec, 10 secs
lola: 35048 markings, 70001 edges, 1914 markings/sec, 15 secs
lola: 44599 markings, 87144 edges, 1910 markings/sec, 20 secs
lola: 54337 markings, 104399 edges, 1948 markings/sec, 25 secs
lola: 64249 markings, 122878 edges, 1982 markings/sec, 30 secs
lola: 74592 markings, 140389 edges, 2069 markings/sec, 35 secs
lola: 85399 markings, 158641 edges, 2161 markings/sec, 40 secs
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: 95370 markings, 174083 edges
lola: ========================================

FORMULA PolyORBLF-PT-S06J04T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no yes yes yes yes no no no no
lola:
preliminary result: no no no yes no no yes no yes yes yes yes no no no no
lola: memory consumption: 29180 KB
lola: time consumption: 393 seconds

BK_STOP 1553000627632

--------------------
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="PolyORBLF-PT-S06J04T04"
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 PolyORBLF-PT-S06J04T04, 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 r121-smll-155272326200119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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