Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-PT-S02J04T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257700393
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528025620045

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-PT-S02J04T10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-PT-S02J04T10 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S02J04T10 @ 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: 2324/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: Size of bit vector: 24064
lola: finding significant places
lola: 752 places, 1572 transitions, 698 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2143 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J04T10-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= P_1716)
lola: A (F (G (G (X ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1)))))) : A (F (F (X (X ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6 + Abort_Check_Sources_E_7 + Abort_Check_Sources_E_8 + Abort_Check_Sources_E_9)))))) : A (X ((SigAbort <= BlockedTasks))) : A (X (G (G ((NoSigAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10))))) : A (F (X (G (X (FALSE))))) : A ((NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 + Check_Sources_B_7 + Check_Sources_B_8 + Check_Sources_B_9)) : A (X (G (X (X ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 + ScheduleTaskE_Idle_10 <= IsMonitoring)))))) : A ((((IsMonitoring <= ORB_Lock) U (1 <= cIsMonitoring)) U F (X ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + ProcessingEvt_8 + ProcessingEvt_9 + ProcessingEvt_10))))) : A ((X (F ((P_2321_3 <= Insert_Source_B_8_2))) U G (X ((P_1712_0 <= P_1160_6))))) : A (F ((Abort_Check_Sources_E_9 <= P_1158_3))) : A ((AwakeTasks_7 <= ScheduleTaskE_Idle_2)) : A (X ((Check_Sources_E_7 <= NotifyEventJobQueuedB_5_2))) : A (X (F (G (X ((NotifyEventJobQueuedB_1_1 <= NotifyEventEndOfCheckSourcesE_3)))))) : A (((ScheduleTaskB_10 <= AvailableJobId_4) U (AwakeTasks_6 <= CreatedJobs_2_1))) : A ((ScheduleTaskB_10 <= P_2579_8_2)) : A ((P_2579_1_1 <= AvailableJobId_1))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: 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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: ========================================
check_solution: Constraint R9 = 0 is above its equality of -1
check_solution: Constraint R10 = 0 is above its equality of -1
check_solution: Constraint R47 = 0 is above its equality of -1
check_solution: Constraint R93 = 0 is above its equality of -1
check_solution: Constraint R94 = 0 is above its equality of -1
check_solution: Constraint R106 = 0 is above its equality of -1
check_solution: Constraint R107 = 0 is above its equality of -1
check_solution: Constraint R108 = 0 is above its equality of -1
check_solution: Constraint R109 = 0 is above its equality of -1
check_solution: Constraint R110 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Variable C728 = -0.430793523101 is below its lower bound 0
check_solution: Variable C731 = -1 is below its lower bound 0
check_solution: Variable C1530 = -3.71622732448 is below its lower bound 0
check_solution: Variable C1532 = -3.71622732448 is below its lower bound 0
check_solution: Variable C1822 = -11.7491835801 is below its lower bound 0
check_solution: Variable C1922 = -4.60532899117 is below its lower bound 0
check_solution: Variable C1924 = -4.60532899117 is below its lower bound 0
check_solution: Variable C2039 = -11.4753008751 is below its lower bound 0
check_solution: Variable C2129 = -0.916801030673 is below its lower bound 0
check_solution: Constraint R1 = 4.66217679676e-310 is below its lower bound 1

Seriously low accuracy found ||*|| = 11.7492 (rel. error 11.7492)

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-4 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: (NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NotifyEventEndOfCheckSourcesE_10 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8 + NotifyEventEndOfCheckSourcesE_9 <= Check_Sources_B_10 + Check_Sources_B_1 + Check_Sources_B_... (shortened)
lola: processed formula length: 542
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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-S02J04T10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AwakeTasks_7 <= ScheduleTaskE_Idle_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AwakeTasks_7 <= ScheduleTaskE_Idle_2)
lola: processed formula length: 38
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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-S02J04T10-LTLCardinality-10 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: (ScheduleTaskB_10 <= P_2579_8_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskB_10 <= P_2579_8_2)
lola: processed formula length: 32
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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-S02J04T10-LTLCardinality-14 TRUE 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: (P_2579_1_1 <= AvailableJobId_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_2579_1_1 <= AvailableJobId_1)
lola: processed formula length: 32
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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-S02J04T10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 + ScheduleTaskE_Idle_10 <= IsMonitoring))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_9 + ScheduleTaskE_Idle_10 <= IsMonitoring))))))
lola: processed formula length: 266
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1480 markings, 1480 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-6 FALSE 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: A ((((IsMonitoring <= ORB_Lock) U (1 <= cIsMonitoring)) U X (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + Process... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((IsMonitoring <= ORB_Lock) U (1 <= cIsMonitoring)) U X (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10 <= ProcessingEvt_1 + ProcessingEvt_2 + ProcessingEvt_3 + ProcessingEvt_4 + ProcessingEvt_5 + ProcessingEvt_6 + ProcessingEvt_7 + Process... (shortened)
lola: processed formula length: 450
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 5 markings, 4 edges

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((P_2321_3 <= Insert_Source_B_8_2)) U G ((P_1712_0 <= P_1160_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((P_2321_3 <= Insert_Source_B_8_2)) U G ((P_1712_0 <= P_1160_6)))))
lola: processed formula length: 76
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1524 markings, 1532 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-8 FALSE 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 (X (G ((NoSigAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((NoSigAbort <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10))))
lola: processed formula length: 266
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 1480 markings, 1480 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 484 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Check_Sources_E_7 <= NotifyEventJobQueuedB_5_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Check_Sources_E_7 <= NotifyEventJobQueuedB_5_2)))
lola: processed formula length: 56
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 3 markings, 2 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_So... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 + TryAllocateOneTaskE_7 + TryAllocateOneTaskE_8 + TryAllocateOneTaskE_9 + TryAllocateOneTaskE_10 <= Abort_Check_Sources_E_10 + Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_So... (shortened)
lola: processed formula length: 518
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 6 markings, 6 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((SigAbort <= BlockedTasks)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((SigAbort <= BlockedTasks)))
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 3 markings, 2 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 847 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Abort_Check_Sources_E_9 <= P_1158_3)))
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_1158_3 + 1 <= Abort_Check_Sources_E_9)
lola: processed formula length: 41
lola: 32 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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 PolyORBLF-PT-S02J04T10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((NotifyEventJobQueuedB_1_1 <= NotifyEventEndOfCheckSourcesE_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((NotifyEventJobQueuedB_1_1 <= NotifyEventEndOfCheckSourcesE_3))))
lola: processed formula length: 74
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 60667 markings, 64068 edges, 12133 markings/sec, 0 secs
lola: 124653 markings, 132912 edges, 12797 markings/sec, 5 secs
lola: 188534 markings, 202261 edges, 12776 markings/sec, 10 secs
lola: 252646 markings, 272419 edges, 12822 markings/sec, 15 secs
lola: 316368 markings, 341849 edges, 12744 markings/sec, 20 secs
lola: 380084 markings, 412096 edges, 12743 markings/sec, 25 secs
lola: 444289 markings, 482939 edges, 12841 markings/sec, 30 secs
lola: 508407 markings, 553877 edges, 12824 markings/sec, 35 secs
lola: 572396 markings, 624950 edges, 12798 markings/sec, 40 secs
lola: 636564 markings, 696472 edges, 12834 markings/sec, 45 secs
lola: 700837 markings, 767715 edges, 12855 markings/sec, 50 secs
lola: 765152 markings, 839265 edges, 12863 markings/sec, 55 secs
lola: add low 118
lola: add low 14
lola: add low 383
lola: add low 1272
lola: add low 1545
lola: add low 550
lola: add low 775
lola: add low 1167
lola: add low 886
lola: add low 1379
lola: add low 729
lola: add low 1064
lola: add low 1281
lola: add low 1401
lola: add low 321
lola: add low 1467
lola: add low 340
lola: add low 1354
lola: add low 1178
lola: add low 198
lola: add low 849
lola: add low 1429
lola: add low 75
lola: add low 1167
lola: add low 886
lola: add low 1379
lola: add low 1520
lola: add low 1055
lola: add low 1290
lola: add low 1003
lola: add low 1394
lola: add low 1012
lola: add low 929
lola: add low 331
lola: add low 1133
lola: add low 920
lola: add low 832
lola: add low 989
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: 780249 markings, 855905 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1663 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 + TryAllocateOneTaskB_9 + TryAllocateOneTaskB_10 <= P_2321_10 + P_2321_9 + P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1))))
lola: processed formula length: 364
lola: 30 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-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: 3974 markings, 4085 edges
lola: ========================================

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ScheduleTaskB_10 <= AvailableJobId_4) U (AwakeTasks_6 <= CreatedJobs_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((ScheduleTaskB_10 <= AvailableJobId_4) U (AwakeTasks_6 <= CreatedJobs_2_1)))
lola: processed formula length: 80
lola: 34 rewrites
lola: closed formula file PolyORBLF-PT-S02J04T10-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges

FORMULA PolyORBLF-PT-S02J04T10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes no yes yes yes no yes yes yes
lola:
preliminary result: no yes yes no no yes no yes no yes yes yes no yes yes yes
lola: ========================================
lola: memory consumption: 21720 KB
lola: time consumption: 243 seconds

BK_STOP 1528025863567

--------------------
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-S02J04T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PolyORBLF-PT-S02J04T10, 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 r208-smll-152732257700393"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;