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 5.8M
-rw-r--r-- 1 mcc users 6.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 180K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 578K 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 5.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K 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 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K 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 4.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529200185
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526836386488


BK_STOP 1526837470837

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S04J04T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3135336, 'Memory': 15952.89, 'Tool': 'lola'}, {'Time': 3284725, 'Memory': 15952.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S04J04T08...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PolyORBLF-PT-S04J04T08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J04T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PolyORBLF-PT-S04J04T08 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4724/65536 symbol table entries, 1248 collisions
lola: preprocessing...
lola: finding significant places
lola: 712 places, 4012 transitions, 658 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2451 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: NOT((A (X ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))) AND E (F ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_7_3 + DisablePollingE_7_4 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_8_3 + DisablePollingE_8_4 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8))))) : E (F ((cJobCnt <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))) : E (X (E (G (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 <= P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1) OR (2 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4)))))) : A (G (A (F (((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8) OR (1 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4)))))) : E (G ((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8))) : ((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8) AND NOT(E (F (((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) AND (1 <= ORB_Lock)))))) : E (G (NOT(A (G ((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 <= P_1099)))))) : (A (G (((2 <= P_1717) OR (P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + 1 <= cJobCnt)))) AND ((P_1097 <= IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1) OR NOT(E (X ((2 <= ORB_Lock)))))) : NOT(A (X (A (F ((3 <= CreatedJobs_0_4)))))) : E ((((1 <= ScheduleTaskE_Check_2) AND ((P_1119_6_3 <= DisablePollingB_7_2) OR (Check_Sources_B_1 <= ScheduleTaskE_Work_5_1))) U E (F ((1 <= NotifyEventJobQueuedB_8_0))))) : A (F ((DisablePollingB_4_3 + 1 <= TryAllocateOneTaskE_4))) : (E (G ((3 <= ScheduleTaskE_Idle_5))) OR E (G ((DisablePollingE_3_2 <= DisablePollingE_6_1)))) : NOT(E (G (A (F ((1 <= EnablePollingE_5)))))) : E (G ((((DisablePollingB_7_1 <= 1) OR (P_1160_6 <= 0)) AND ((DisablePollingE_2_2 <= 1) OR (CreatedJobs_2_2 <= 2))))) : E ((((Check_Sources_E_7 + 1 <= QueueJobE_7) AND (NotifyEventJobQueuedB_7_4 <= 2)) U A (F ((2 <= ScheduleTaskE_Work_3_1))))) : A (F (E (F (((3 <= TryAllocateOneTaskB_2) OR (3 <= NotifyEventJobCompletedB_3))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X ((P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))) AND E (F ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + 1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6 + P_1617_7 + P_1617_8))
lola: processed formula length: 191
lola: 8 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + DisablePol... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
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: 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: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cJobCnt <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T08-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 23911 markings, 25917 edges, 4782 markings/sec, 0 secs
lola: sara is running 5 secs || 47671 markings, 52508 edges, 4752 markings/sec, 5 secs
lola: sara is running 10 secs || 71346 markings, 80322 edges, 4735 markings/sec, 10 secs
lola: sara is running 15 secs || 95078 markings, 107858 edges, 4746 markings/sec, 15 secs
lola: sara is running 20 secs || 118721 markings, 136400 edges, 4729 markings/sec, 20 secs
lola: sara is running 25 secs || 142334 markings, 164495 edges, 4723 markings/sec, 25 secs
lola: sara is running 30 secs || 166013 markings, 193243 edges, 4736 markings/sec, 30 secs
lola: sara is running 35 secs || 189687 markings, 225072 edges, 4735 markings/sec, 35 secs
lola: sara is running 40 secs || 213079 markings, 252960 edges, 4678 markings/sec, 40 secs
lola: sara is running 45 secs || 236515 markings, 280919 edges, 4687 markings/sec, 45 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 <= P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1) OR (2 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((P_2321_8 + P_2321_7 + P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 + 1 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8) AND (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 1)))))
lola: processed formula length: 265
lola: 3 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 620114 markings, 1370172 edges, 2905766240142229504 markings/sec, 0 secs
lola: 1203684 markings, 2671629 edges, 116714 markings/sec, 5 secs
lola: 1788030 markings, 3963385 edges, 116869 markings/sec, 10 secs
lola: 2361243 markings, 5271991 edges, 114643 markings/sec, 15 secs
lola: 2912614 markings, 6580552 edges, 110274 markings/sec, 20 secs
lola: 3466815 markings, 7842522 edges, 110840 markings/sec, 25 secs
lola: 4022460 markings, 9113556 edges, 111129 markings/sec, 30 secs
lola: 4562346 markings, 10349262 edges, 107977 markings/sec, 35 secs
lola: 5107855 markings, 11607923 edges, 109102 markings/sec, 40 secs
lola: 5635282 markings, 12892755 edges, 105485 markings/sec, 45 secs
lola: 6122190 markings, 14183904 edges, 97382 markings/sec, 50 secs
lola: 6588960 markings, 15441172 edges, 93354 markings/sec, 55 secs
lola: 7063456 markings, 16821900 edges, 94899 markings/sec, 60 secs
lola: 7521545 markings, 18175400 edges, 91618 markings/sec, 65 secs
lola: 7975692 markings, 19543840 edges, 90829 markings/sec, 70 secs
lola: 8429501 markings, 20932320 edges, 90762 markings/sec, 75 secs
lola: 8813653 markings, 22254667 edges, 76830 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8820705 markings, 22282533 edges
lola: ========================================
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobComplete... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEv... (shortened)
lola: processed formula length: 1433
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 386551 markings, 799958 edges, 3689348869717491712 markings/sec, 0 secs
lola: 751114 markings, 1560192 edges, 72913 markings/sec, 5 secs
lola: 1116588 markings, 2325918 edges, 73095 markings/sec, 10 secs
lola: 1477103 markings, 3083617 edges, 72103 markings/sec, 15 secs
lola: 1830337 markings, 3827749 edges, 70647 markings/sec, 20 secs
lola: 2182608 markings, 4571683 edges, 70454 markings/sec, 25 secs
lola: 2532119 markings, 5311745 edges, 69902 markings/sec, 30 secs
lola: 2876361 markings, 6044083 edges, 68848 markings/sec, 35 secs
lola: 3208381 markings, 6749511 edges, 66404 markings/sec, 40 secs
lola: 3547612 markings, 7469954 edges, 67846 markings/sec, 45 secs
lola: 3884980 markings, 8189329 edges, 67474 markings/sec, 50 secs
lola: 4222733 markings, 8909631 edges, 67551 markings/sec, 55 secs
lola: 4556504 markings, 9623539 edges, 66754 markings/sec, 60 secs
lola: 4889745 markings, 10335541 edges, 66648 markings/sec, 65 secs
lola: 5222352 markings, 11045321 edges, 66521 markings/sec, 70 secs
lola: 5552718 markings, 11751362 edges, 66073 markings/sec, 75 secs
lola: 5881922 markings, 12455972 edges, 65841 markings/sec, 80 secs
lola: 6209461 markings, 13157104 edges, 65508 markings/sec, 85 secs
lola: 6536989 markings, 13859658 edges, 65506 markings/sec, 90 secs
lola: 6861973 markings, 14558011 edges, 64997 markings/sec, 95 secs
lola: 7187203 markings, 15255789 edges, 65046 markings/sec, 100 secs
lola: 7510814 markings, 15952022 edges, 64722 markings/sec, 105 secs
lola: 7833467 markings, 16645579 edges, 64531 markings/sec, 110 secs
lola: 8154290 markings, 17336280 edges, 64165 markings/sec, 115 secs
lola: 8474652 markings, 18027019 edges, 64072 markings/sec, 120 secs
lola: 8797103 markings, 18720534 edges, 64490 markings/sec, 125 secs
lola: 9115733 markings, 19409390 edges, 63726 markings/sec, 130 secs
lola: 9433784 markings, 20094326 edges, 63610 markings/sec, 135 secs
lola: 9752568 markings, 20779190 edges, 63757 markings/sec, 140 secs
lola: 10067314 markings, 21461908 edges, 62949 markings/sec, 145 secs
lola: 10380278 markings, 22138802 edges, 62593 markings/sec, 150 secs
lola: 10691733 markings, 22814204 edges, 62291 markings/sec, 155 secs
lola: 11002452 markings, 23489511 edges, 62144 markings/sec, 160 secs
lola: 11313026 markings, 24162290 edges, 62115 markings/sec, 165 secs
lola: 11620596 markings, 24831866 edges, 61514 markings/sec, 170 secs
lola: 11929238 markings, 25503129 edges, 61728 markings/sec, 175 secs
lola: 12237299 markings, 26174830 edges, 61612 markings/sec, 180 secs
lola: 12545734 markings, 26843729 edges, 61687 markings/sec, 185 secs
lola: 12851172 markings, 27507622 edges, 61088 markings/sec, 190 secs
lola: 13157485 markings, 28175373 edges, 61263 markings/sec, 195 secs
lola: 13462930 markings, 28838063 edges, 61089 markings/sec, 200 secs
lola: 13768706 markings, 29502106 edges, 61155 markings/sec, 205 secs
lola: 13931561 markings, 29856153 edges, 32571 markings/sec, 210 secs
lola: 13932625 markings, 29858433 edges, 213 markings/sec, 215 secs
lola: 13932662 markings, 29858517 edges, 7 markings/sec, 220 secs
lola: 13933181 markings, 29859614 edges, 104 markings/sec, 225 secs
lola: 13933709 markings, 29860790 edges, 106 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8 <= 2)))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 402 markings, 402 edges
lola: ========================================
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8) AND NOT(E (F (((3 <= TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8) AND (1 <= ORB_Lock))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 + Idle_7 + Idle_8)
lola: processed formula length: 76
lola: 3 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.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: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 + TryAllocateOneTaskB_7 + TryAllocateOneTaskB_8 <= 2) OR (ORB_Lock <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T08-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T08-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 35056 markings, 36427 edges, 7011 markings/sec, 0 secs
lola: sara is running 5 secs || 69789 markings, 73632 edges, 6947 markings/sec, 5 secs
lola: sara is running 10 secs || 104629 markings, 111032 edges, 6968 markings/sec, 10 secs
lola: sara is running 15 secs || 139299 markings, 149587 edges, 6934 markings/sec, 15 secs
lola: sara is running 20 secs || 174331 markings, 188602 edges, 7006 markings/sec, 20 secs
lola: sara is running 25 secs || 209715 markings, 227922 edges, 7077 markings/sec, 25 secs
lola: sara is running 30 secs || 245546 markings, 267019 edges, 7166 markings/sec, 30 secs
lola: sara is running 35 secs || 281141 markings, 306311 edges, 7119 markings/sec, 35 secs
lola: sara is running 40 secs || 316965 markings, 346282 edges, 7165 markings/sec, 40 secs
lola: sara is running 45 secs || 351903 markings, 386569 edges, 6988 markings/sec, 45 secs
lola: sara is running 50 secs || 387322 markings, 425804 edges, 7084 markings/sec, 50 secs
lola: sara is running 55 secs || 422789 markings, 465590 edges, 7093 markings/sec, 55 secs
lola: sara is running 60 secs || 458066 markings, 504950 edges, 7055 markings/sec, 60 secs
lola: sara is running 65 secs || 493883 markings, 544194 edges, 7163 markings/sec, 65 secs
lola: sara is running 70 secs || 529399 markings, 583769 edges, 7103 markings/sec, 70 secs
lola: sara is running 75 secs || 564022 markings, 623680 edges, 6925 markings/sec, 75 secs
lola: sara is running 80 secs || 599632 markings, 662867 edges, 7122 markings/sec, 80 secs
lola: sara is running 85 secs || 634681 markings, 702783 edges, 7010 markings/sec, 85 secs
lola: sara is running 90 secs || 670000 markings, 742217 edges, 7064 markings/sec, 90 secs
lola: sara is running 95 secs || 705478 markings, 782160 edges, 7096 markings/sec, 95 secs
lola: sara is running 100 secs || 741496 markings, 822364 edges, 7204 markings/sec, 100 secs
lola: sara is running 105 secs || 776848 markings, 861317 edges, 7070 markings/sec, 105 secs
lola: sara is running 110 secs || 812817 markings, 902107 edges, 7194 markings/sec, 110 secs
lola: sara is running 115 secs || 848932 markings, 942277 edges, 7223 markings/sec, 115 secs
lola: sara is running 120 secs || 884567 markings, 982138 edges, 7127 markings/sec, 120 secs
lola: sara is running 125 secs || 920559 markings, 1022600 edges, 7198 markings/sec, 125 secs
lola: sara is running 130 secs || 956175 markings, 1062575 edges, 7123 markings/sec, 130 secs
lola: sara is running 135 secs || 992134 markings, 1102538 edges, 7192 markings/sec, 135 secs
lola: sara is running 140 secs || 1027821 markings, 1142250 edges, 7137 markings/sec, 140 secs
lola: sara is running 145 secs || 1063020 markings, 1181436 edges, 7040 markings/sec, 145 secs
lola: sara is running 150 secs || 1098646 markings, 1221187 edges, 7125 markings/sec, 150 secs
lola: sara is running 155 secs || 1134959 markings, 1261636 edges, 7263 markings/sec, 155 secs
lola: sara is running 160 secs || 1171001 markings, 1301957 edges, 7208 markings/sec, 160 secs
lola: sara is running 165 secs || 1207422 markings, 1342123 edges, 7284 markings/sec, 165 secs
lola: sara is running 170 secs || 1243508 markings, 1382430 edges, 7217 markings/sec, 170 secs
lola: sara is running 175 secs || 1279588 markings, 1422557 edges, 7216 markings/sec, 175 secs
lola: sara is running 180 secs || 1315032 markings, 1462712 edges, 7089 markings/sec, 180 secs
lola: sara is running 185 secs || 1351172 markings, 1503182 edges, 7228 markings/sec, 185 secs
lola: sara is running 190 secs || 1387406 markings, 1543584 edges, 7247 markings/sec, 190 secs
lola: sara is running 195 secs || 1423830 markings, 1583842 edges, 7285 markings/sec, 195 secs
lola: sara is running 200 secs || 1460457 markings, 1624630 edges, 7325 markings/sec, 200 secs
lola: sara is running 205 secs || 1496281 markings, 1664176 edges, 7165 markings/sec, 205 secs
lola: sara is running 210 secs || 1532589 markings, 1704795 edges, 7262 markings/sec, 210 secs
lola: sara is running 215 secs || 1568567 markings, 1744983 edges, 7196 markings/sec, 215 secs
lola: sara is running 220 secs || 1604987 markings, 1785821 edges, 7284 markings/sec, 220 secs
lola: sara is running 225 secs || 1640947 markings, 1825982 edges, 7192 markings/sec, 225 secs
lola: sara is running 230 secs || 1676765 markings, 1866568 edges, 7164 markings/sec, 230 secs
lola: sara is running 235 secs || 1712331 markings, 1906252 edges, 7113 markings/sec, 235 secs
lola: sara is running 240 secs || 1748088 markings, 1946173 edges, 7151 markings/sec, 240 secs
lola: sara is running 245 secs || 1783597 markings, 1986021 edges, 7102 markings/sec, 245 secs
lola: sara is running 250 secs || 1819553 markings, 2026245 edges, 7191 markings/sec, 250 secs
lola: sara is running 255 secs || 1855169 markings, 2066185 edges, 7123 markings/sec, 255 secs
lola: sara is running 260 secs || 1890702 markings, 2106722 edges, 7107 markings/sec, 260 secs
lola: sara is running 265 secs || 1925849 markings, 2147277 edges, 7029 markings/sec, 265 secs
lola: sara is running 270 secs || 1962118 markings, 2187771 edges, 7254 markings/sec, 270 secs
lola: sara is running 275 secs || 1998234 markings, 2228170 edges, 7223 markings/sec, 275 secs
lola: sara is running 280 secs || 2034527 markings, 2268590 edges, 7259 markings/sec, 280 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4 <= P_1099))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (P_1099 + 1 <= ModifiedSrc_1 + ModifiedSrc_2 + ModifiedSrc_3 + ModifiedSrc_4)))))
lola: processed formula length: 107
lola: 5 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 402 markings, 1099 edges
lola: ========================================
lola: subprocess 7 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((2 <= P_1717) OR (P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + 1 <= cJobCnt)))) AND ((P_1097 <= IdleTasks_8 + IdleTasks_7 + IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1) OR NOT(E (X ((2 <= ORB_Lock))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P_1717) OR (P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8 + 1 <= cJobCnt))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T08-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T08-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 24212 markings, 26375 edges, 4842 markings/sec, 0 secs
lola: sara is running 5 secs || 48362 markings, 53373 edges, 4830 markings/sec, 5 secs
lola: sara is running 10 secs || 72382 markings, 80681 edges, 4804 markings/sec, 10 secs
lola: sara is running 15 secs || 96267 markings, 108009 edges, 4777 markings/sec, 15 secs
lola: sara is running 20 secs || 120228 markings, 135607 edges, 4792 markings/sec, 20 secs
lola: sara is running 25 secs || 144068 markings, 163811 edges, 4768 markings/sec, 25 secs
lola: sara is running 30 secs || 167939 markings, 192043 edges, 4774 markings/sec, 30 secs
lola: sara is running 35 secs || 191777 markings, 221102 edges, 4768 markings/sec, 35 secs
lola: sara is running 40 secs || 215657 markings, 250248 edges, 4776 markings/sec, 40 secs
lola: sara is running 45 secs || 239427 markings, 279175 edges, 4754 markings/sec, 45 secs
lola: sara is running 50 secs || 263319 markings, 308162 edges, 4778 markings/sec, 50 secs
lola: sara is running 55 secs || 287131 markings, 337210 edges, 4762 markings/sec, 55 secs
lola: sara is running 60 secs || 310861 markings, 366279 edges, 4746 markings/sec, 60 secs
lola: sara is running 65 secs || 334585 markings, 395163 edges, 4745 markings/sec, 65 secs
lola: sara is running 70 secs || 358272 markings, 424618 edges, 4737 markings/sec, 70 secs
lola: sara is running 75 secs || 382081 markings, 453749 edges, 4762 markings/sec, 75 secs
lola: sara is running 80 secs || 405826 markings, 483671 edges, 4749 markings/sec, 80 secs
lola: sara is running 85 secs || 429581 markings, 513516 edges, 4751 markings/sec, 85 secs
lola: sara is running 90 secs || 453477 markings, 542682 edges, 4779 markings/sec, 90 secs
lola: sara is running 95 secs || 477330 markings, 572640 edges, 4771 markings/sec, 95 secs
lola: sara is running 100 secs || 501149 markings, 603175 edges, 4764 markings/sec, 100 secs
lola: sara is running 105 secs || 524882 markings, 633067 edges, 4747 markings/sec, 105 secs
lola: sara is running 110 secs || 548602 markings, 662959 edges, 4744 markings/sec, 110 secs
lola: sara is running 115 secs || 572367 markings, 692301 edges, 4753 markings/sec, 115 secs
lola: sara is running 120 secs || 596064 markings, 722503 edges, 4739 markings/sec, 120 secs
lola: sara is running 125 secs || 619965 markings, 751809 edges, 4780 markings/sec, 125 secs
lola: sara is running 130 secs || 643677 markings, 781824 edges, 4742 markings/sec, 130 secs
lola: sara is running 135 secs || 667382 markings, 811436 edges, 4741 markings/sec, 135 secs
lola: sara is running 140 secs || 691156 markings, 841408 edges, 4755 markings/sec, 140 secs
lola: sara is running 145 secs || 714952 markings, 872685 edges, 4759 markings/sec, 145 secs
lola: sara is running 150 secs || 738565 markings, 902388 edges, 4723 markings/sec, 150 secs
lola: sara is running 155 secs || 762250 markings, 931572 edges, 4737 markings/sec, 155 secs
lola: sara is running 160 secs || 785898 markings, 961200 edges, 4730 markings/sec, 160 secs
lola: sara is running 165 secs || 809518 markings, 991561 edges, 4724 markings/sec, 165 secs
lola: sara is running 170 secs || 833130 markings, 1021925 edges, 4722 markings/sec, 170 secs
lola: sara is running 175 secs || 856838 markings, 1052743 edges, 4742 markings/sec, 175 secs
lola: sara is running 180 secs || 880523 markings, 1083494 edges, 4737 markings/sec, 180 secs
lola: sara is running 185 secs || 904163 markings, 1113842 edges, 4728 markings/sec, 185 secs
lola: sara is running 190 secs || 927654 markings, 1143923 edges, 4698 markings/sec, 190 secs
lola: sara is running 195 secs || 951307 markings, 1173726 edges, 4731 markings/sec, 195 secs
lola: sara is running 200 secs || 974931 markings, 1204377 edges, 4725 markings/sec, 200 secs
lola: sara is running 205 secs || 998606 markings, 1235371 edges, 4735 markings/sec, 205 secs
lola: sara is running 210 secs || 1022234 markings, 1267138 edges, 4726 markings/sec, 210 secs
lola: sara is running 215 secs || 1045891 markings, 1297308 edges, 4731 markings/sec, 215 secs
lola: sara is running 220 secs || 1069486 markings, 1327268 edges, 4719 markings/sec, 220 secs
lola: sara is running 225 secs || 1093170 markings, 1357699 edges, 4737 markings/sec, 225 secs
lola: sara is running 230 secs || 1116768 markings, 1387712 edges, 4720 markings/sec, 230 secs
lola: sara is running 235 secs || 1140350 markings, 1418596 edges, 4716 markings/sec, 235 secs
lola: sara is running 240 secs || 1164075 markings, 1448859 edges, 4745 markings/sec, 240 secs
lola: sara is running 245 secs || 1187834 markings, 1478591 edges, 4752 markings/sec, 245 secs
lola: sara is running 250 secs || 1211430 markings, 1508425 edges, 4719 markings/sec, 250 secs
lola: sara is running 255 secs || 1235156 markings, 1538696 edges, 4745 markings/sec, 255 secs
lola: sara is running 260 secs || 1258683 markings, 1569145 edges, 4705 markings/sec, 260 secs
lola: sara is running 265 secs || 1282241 markings, 1599525 edges, 4712 markings/sec, 265 secs
lola: sara is running 270 secs || 1305847 markings, 1629800 edges, 4721 markings/sec, 270 secs
lola: sara is running 275 secs || 1329447 markings, 1660242 edges, 4720 markings/sec, 275 secs
lola: sara is running 280 secs || 1352995 markings, 1691749 edges, 4710 markings/sec, 280 secs
lola: sara is running 285 secs || 1376638 markings, 1722555 edges, 4729 markings/sec, 285 secs
lola: sara is running 290 secs || 1400187 markings, 1752680 edges, 4710 markings/sec, 290 secs
lola: sara is running 295 secs || 1423662 markings, 1782660 edges, 4695 markings/sec, 295 secs
lola: sara is running 300 secs || 1447225 markings, 1813027 edges, 4713 markings/sec, 300 secs
lola: sara is running 305 secs || 1470823 markings, 1843093 edges, 4720 markings/sec, 305 secs
lola: sara is running 310 secs || 1494364 markings, 1873203 edges, 4708 markings/sec, 310 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (F ((3 <= CreatedJobs_0_4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (3 <= CreatedJobs_0_4))))
lola: processed formula length: 41
lola: 8 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 401 markings, 401 edges
lola: ========================================
lola: subprocess 9 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= ScheduleTaskE_Check_2) AND ((P_1119_6_3 <= DisablePollingB_7_2) OR (Check_Sources_B_1 <= ScheduleTaskE_Work_5_1))) U E (F ((1 <= NotifyEventJobQueuedB_8_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= ScheduleTaskE_Check_2) AND ((P_1119_6_3 <= DisablePollingB_7_2) OR (Check_Sources_B_1 <= ScheduleTaskE_Work_5_1))) U E(TRUE U (1 <= NotifyEventJobQueuedB_8_0)))
lola: processed formula length: 170
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1844 markings, 1865 edges
lola: ========================================
lola: subprocess 10 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((DisablePollingB_4_3 + 1 <= TryAllocateOneTaskE_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((DisablePollingB_4_3 + 1 <= TryAllocateOneTaskE_4)))
lola: processed formula: A (F ((DisablePollingB_4_3 + 1 <= TryAllocateOneTaskE_4)))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2636 bytes per marking, with 31 unused bits
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: 679 markings, 679 edges
lola: ========================================
lola: subprocess 11 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((3 <= ScheduleTaskE_Idle_5))) OR E (G ((DisablePollingE_3_2 <= DisablePollingE_6_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= ScheduleTaskE_Idle_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (ScheduleTaskE_Idle_5 <= 2)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((DisablePollingE_3_2 <= DisablePollingE_6_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (DisablePollingE_6_1 + 1 <= DisablePollingE_3_2)))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 402 markings, 402 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= EnablePollingE_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= EnablePollingE_5))))
lola: processed formula length: 48
lola: 8 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 92054 markings, 202440 edges
lola: ========================================
lola: subprocess 13 will run for 848 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((DisablePollingB_7_1 <= 1) OR (P_1160_6 <= 0)) AND ((DisablePollingE_2_2 <= 1) OR (CreatedJobs_2_2 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((2 <= DisablePollingB_7_1) AND (1 <= P_1160_6)) OR ((2 <= DisablePollingE_2_2) AND (3 <= CreatedJobs_2_2)))))
lola: processed formula length: 125
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 402 markings, 402 edges
lola: ========================================
lola: subprocess 14 will run for 1273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Check_Sources_E_7 + 1 <= QueueJobE_7) AND (NotifyEventJobQueuedB_7_4 <= 2)) U A (F ((2 <= ScheduleTaskE_Work_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((Check_Sources_E_7 + 1 <= QueueJobE_7) AND (NotifyEventJobQueuedB_7_4 <= 2)) U A(TRUE U (2 <= ScheduleTaskE_Work_3_1)))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 402 markings, 403 edges
lola: ========================================
lola: subprocess 15 will run for 2546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((3 <= TryAllocateOneTaskB_2) OR (3 <= NotifyEventJobCompletedB_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((3 <= TryAllocateOneTaskB_2) OR (3 <= NotifyEventJobCompletedB_3))))
lola: processed formula length: 88
lola: 2 rewrites
lola: formula mentions 0 of 712 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S04J04T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2632 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 523471 markings, 544297 edges, 3687031648961953792 markings/sec, 0 secs
lola: 1018771 markings, 1064426 edges, 99060 markings/sec, 5 secs
lola: 1504570 markings, 1579587 edges, 97160 markings/sec, 10 secs
lola: 1982379 markings, 2088293 edges, 95562 markings/sec, 15 secs
lola: 2455747 markings, 2595468 edges, 94674 markings/sec, 20 secs
lola: 2921186 markings, 3093742 edges, 93088 markings/sec, 25 secs
lola: 3379572 markings, 3585007 edges, 91677 markings/sec, 30 secs
lola: 3708794 markings, 3940884 edges, 65844 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3708794 markings, 3940884 edges
lola: RESULT
lola:
SUMMARY: no no yes unknown yes unknown yes unknown yes yes no yes yes yes no yes
lola: ========================================
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

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