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)
..............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is PolyORBNT-PT-S05J40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-149440926100111
=====================================================================

--------------------
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 PolyORBNT-COL-S05J40-CTLCardinality-0
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-1
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-15
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-2
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-3
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-4
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-5
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-6
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-7
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-8
FORMULA_NAME PolyORBNT-COL-S05J40-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494712541799


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ PolyORBNT-PT-S05J40 @ 3540 seconds
----- Start make result stdout -----
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: 2219/65536 symbol table entries, 162 collisions
lola: preprocessing...
lola: finding significant places
lola: 629 places, 1590 transitions, 527 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-CTLCardinality.task
lola: (((E (F ((3 <= Check_Sources_B_1))) AND (mo3 <= place_460)) OR E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))) AND ((Check_Sources_E_1 <= FetchJobB_1) OR ((1 <= NotifyEventEndOfCheckSourcesB_1) AND (place_458 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5)))) : NOT(E (G (A (X ((Perform_Work_E_1 <= JobCnt)))))) : E (G ((Perform_Work_E_1 <= mi1))) : ((((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) OR (mo1 <= 0)) OR E (F ((Try_Check_Sources_E_1 <= 1)))) AND A (F (E (X ((3 <= place_520_1)))))) : A (F (NOT(E (G ((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= Perform_Work_E_1)))))) : E (G ((A (G ((QueueJobE_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40))) OR ((place_518_1 <= 1) AND (Check_Sources_E_1 + 1 <= place_782_1))))) : (E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1))))) AND A (G (E (F ((1 <= Try_Check_Sources_B_1)))))) : A ((E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1))) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1)))) : (E (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 <= mi1))) AND E (F (A (G ((3 <= Check_Sources_E_1)))))) : A ((E (F ((AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_40 + AvailableJobId_34 + AvailableJobId_33 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_21 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16 <= Try_Check_Sources_E_1))) U ((1 <= place_782_1) AND (Perform_Work_E_1 <= Schedule_Task_E_1_PerformWork_10 + Schedule_Task_E_1_PerformWork_11 + Schedule_Task_E_1_PerformWork_12 + Schedule_Task_E_1_PerformWork_13 + Schedule_Task_E_1_PerformWork_14 + Schedule_Task_E_1_PerformWork_15 + Schedule_Task_E_1_PerformWork_16 + Schedule_Task_E_1_PerformWork_17 + Schedule_Task_E_1_PerformWork_18 + Schedule_Task_E_1_PerformWork_19 + Schedule_Task_E_1_PerformWork_20 + Schedule_Task_E_1_PerformWork_21 + Schedule_Task_E_1_PerformWork_22 + Schedule_Task_E_1_PerformWork_23 + Schedule_Task_E_1_PerformWork_24 + Schedule_Task_E_1_PerformWork_25 + Schedule_Task_E_1_PerformWork_26 + Schedule_Task_E_1_PerformWork_27 + Schedule_Task_E_1_PerformWork_28 + Schedule_Task_E_1_PerformWork_29 + Schedule_Task_E_1_PerformWork_30 + Schedule_Task_E_1_PerformWork_31 + Schedule_Task_E_1_PerformWork_32 + Schedule_Task_E_1_PerformWork_33 + Schedule_Task_E_1_PerformWork_34 + Schedule_Task_E_1_PerformWork_35 + Schedule_Task_E_1_PerformWork_36 + Schedule_Task_E_1_PerformWork_37 + Schedule_Task_E_1_PerformWork_38 + Schedule_Task_E_1_PerformWork_39 + Schedule_Task_E_1_PerformWork_40 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_PerformWork_0 + Schedule_Task_E_1_PerformWork_1 + Schedule_Task_E_1_PerformWork_2 + Schedule_Task_E_1_PerformWork_3 + Schedule_Task_E_1_PerformWork_4 + Schedule_Task_E_1_PerformWork_5 + Schedule_Task_E_1_PerformWork_6 + Schedule_Task_E_1_PerformWork_7 + Schedule_Task_E_1_PerformWork_8 + Schedule_Task_E_1_PerformWork_9) AND (DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= mi2)))) : (A (X (A (G ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform_Work_B_1_18 + Perform_Work_B_1_19 + Perform_Work_B_1_20 + Perform_Work_B_1_21 + Perform_Work_B_1_22 + Perform_Work_B_1_23 + Perform_Work_B_1_24 + Perform_Work_B_1_25 + Perform_Work_B_1_26 + Perform_Work_B_1_27 + Perform_Work_B_1_28 + Perform_Work_B_1_29 + Perform_Work_B_1_30 + Perform_Work_B_1_31 + Perform_Work_B_1_32 + Perform_Work_B_1_33 + Perform_Work_B_1_34 + Perform_Work_B_1_35 + Perform_Work_B_1_36 + Perform_Work_B_1_37 + Perform_Work_B_1_38 + Perform_Work_B_1_39 + Perform_Work_B_1_40 <= place_522_1))))) AND A (X ((Perform_Work_E_1 <= 0)))) : (NOT(A (((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))) OR A (F ((1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))) : A (X (A (F ((2 <= Try_Check_Sources_B_1))))) : E (F (A (G (((mi2 <= Check_Sources_B_1) AND (mo2 <= NotifyEventEndOfCheckSourcesB_1)))))) : (A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + QueueJobB_1_23 + QueueJobB_1_24 + QueueJobB_1_25 + QueueJobB_1_26 + QueueJobB_1_27 + QueueJobB_1_28 + QueueJobB_1_29 + QueueJobB_1_30 + QueueJobB_1_31 + QueueJobB_1_32 + QueueJobB_1_33 + QueueJobB_1_34 + QueueJobB_1_35 + QueueJobB_1_36 + QueueJobB_1_37 + QueueJobB_1_38 + QueueJobB_1_39 + QueueJobB_1_40))))) OR A (X ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3)))) : A ((((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + AvailableJobId_8 + AvailableJobId_7 + AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0 + AvailableJobId_40 + AvailableJobId_34 + AvailableJobId_33 + AvailableJobId_32 + AvailableJobId_31 + AvailableJobId_30 + AvailableJobId_29 + AvailableJobId_21 + AvailableJobId_20 + AvailableJobId_19 + AvailableJobId_18 + AvailableJobId_17 + AvailableJobId_16) OR (Perform_Work_E_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40)) U A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= Try_Check_Sources_E_1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((3 <= Check_Sources_B_1))) AND (mo3 <= place_460)) OR E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))) AND ((Check_Sources_E_1 <= FetchJobB_1) OR ((1 <= NotifyEventEndOfCheckSourcesB_1) AND (place_458 <= DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5))))
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 (F ((3 <= Check_Sources_B_1)))
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 2108 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 PolyORBNT-COL-S05J40-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Perform_Work_E_1 + 1 <= NotifyEventEndOfCheckSourcesE_1))
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (X ((Perform_Work_E_1 <= JobCnt))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((JobCnt + 1 <= Perform_Work_E_1)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Perform_Work_E_1 <= mi1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (mi1 + 1 <= Perform_Work_E_1)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) OR (m... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + 1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40) OR (m... (shortened)
lola: processed formula length: 409
lola: 0 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Try_Check_Sources_E_1 <= 1)))
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 2108 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= place_520_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= place_520_1)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (G ((place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 <= Perform_Work_E_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Perform_Work_E_1 + 1 <= place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5))
lola: processed formula length: 113
lola: 5 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((QueueJobE_1 <= f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40))) OR ((place_518_1 <= 1) AND (Check_Sources_E_1 + 1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (f1_0 + f1_1 + f1_2 + f1_3 + f1_4 + f1_5 + f1_6 + f1_7 + f1_8 + f1_9 + f1_10 + f1_11 + f1_12 + f1_13 + f1_14 + f1_15 + f1_16 + f1_17 + f1_18 + f1_19 + f1_20 + f1_21 + f1_22 + f1_23 + f1_24 + f1_25 + f1_26 + f1_27 + f1_28 + f1_29 + f1_30 + f1_31 + f1_32 + f1_33 + f1_34 + f1_35 + f1_36 + f1_37 + f1_38 + f1_39 + f1_40 + 1 <= QueueJobE_1)) AND ((2 <= place_518_1) OR (place_782_... (shortened)
lola: processed formula length: 427
lola: 6 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1))))) AND A (G (E (F ((1 <= Try_Check_Sources_B_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= place_521_1)))))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1))) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 <= QueueJobE_1)) U ((place_522_1 <= 0) AND (cJobCnt + 1 <= place_523_1)))
lola: processed formula length: 143
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perfor... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + Perform... (shortened)
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 2108 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to PolyORBNT-COL-S05J40-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((3 <= Check_Sources_E_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (Check_Sources_E_1 <= 2))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 542176 markings, 1462616 edges, 3225752436249460736 markings/sec, 0 secs
lola: 1017428 markings, 2767552 edges, 95050 markings/sec, 5 secs
lola: 1480911 markings, 4019935 edges, 92697 markings/sec, 10 secs
lola: 1928256 markings, 5220445 edges, 89469 markings/sec, 15 secs
lola: 2358725 markings, 6377625 edges, 86094 markings/sec, 20 secs
lola: 2796427 markings, 7556844 edges, 87540 markings/sec, 25 secs
lola: 3263936 markings, 8824439 edges, 93502 markings/sec, 30 secs
lola: 3746565 markings, 10131544 edges, 96526 markings/sec, 35 secs
lola: 4199463 markings, 11345894 edges, 90580 markings/sec, 40 secs
lola: 4608996 markings, 12467972 edges, 81907 markings/sec, 45 secs
lola: 5047618 markings, 13655686 edges, 87724 markings/sec, 50 secs
lola: 5481442 markings, 14830638 edges, 86765 markings/sec, 55 secs
lola: 5927670 markings, 16035923 edges, 89246 markings/sec, 60 secs
lola: 6380675 markings, 17242165 edges, 90601 markings/sec, 65 secs
lola: 6829027 markings, 18458870 edges, 89670 markings/sec, 70 secs
lola: 7243372 markings, 19595383 edges, 82869 markings/sec, 75 secs
lola: 7658039 markings, 20726917 edges, 82933 markings/sec, 80 secs
lola: 8049549 markings, 21787844 edges, 78302 markings/sec, 85 secs
lola: 8487169 markings, 22975690 edges, 87524 markings/sec, 90 secs
lola: 8930864 markings, 24178576 edges, 88739 markings/sec, 95 secs
lola: 9326055 markings, 25251879 edges, 79038 markings/sec, 100 secs
lola: 9772999 markings, 26469593 edges, 89389 markings/sec, 105 secs
lola: 10196990 markings, 27623317 edges, 84798 markings/sec, 110 secs
lola: 10635199 markings, 28795450 edges, 87642 markings/sec, 115 secs
lola: 11028320 markings, 29882259 edges, 78624 markings/sec, 120 secs
lola: 11471453 markings, 31102091 edges, 88627 markings/sec, 125 secs
lola: 11892368 markings, 32245695 edges, 84183 markings/sec, 130 secs
lola: 12327498 markings, 33444858 edges, 87026 markings/sec, 135 secs
lola: 12754551 markings, 34589581 edges, 85411 markings/sec, 140 secs
lola: 13138859 markings, 35662643 edges, 76862 markings/sec, 145 secs
lola: 13527165 markings, 36723057 edges, 77661 markings/sec, 150 secs
lola: 13886055 markings, 37719722 edges, 71778 markings/sec, 155 secs
lola: 14312662 markings, 38882988 edges, 85321 markings/sec, 160 secs
lola: 14759700 markings, 40117286 edges, 89408 markings/sec, 165 secs
lola: 15131292 markings, 41148545 edges, 74318 markings/sec, 170 secs
lola: 15557284 markings, 42329238 edges, 85198 markings/sec, 175 secs
lola: 15982580 markings, 43502410 edges, 85059 markings/sec, 180 secs
lola: 16349775 markings, 44527896 edges, 73439 markings/sec, 185 secs
lola: 16717352 markings, 45548545 edges, 73515 markings/sec, 190 secs
lola: 17144581 markings, 46752219 edges, 85446 markings/sec, 195 secs
lola: 17527244 markings, 47813660 edges, 76533 markings/sec, 200 secs
lola: 17935197 markings, 48963164 edges, 81591 markings/sec, 205 secs
lola: 18303514 markings, 50003858 edges, 73663 markings/sec, 210 secs
lola: 18659653 markings, 51012670 edges, 71228 markings/sec, 215 secs
lola: 19029017 markings, 52068104 edges, 73873 markings/sec, 220 secs
lola: 19363056 markings, 53031942 edges, 66808 markings/sec, 225 secs
lola: 19737021 markings, 54118560 edges, 74793 markings/sec, 230 secs
lola: 20048956 markings, 55042711 edges, 62387 markings/sec, 235 secs
lola: 20419520 markings, 56154183 edges, 74113 markings/sec, 240 secs
lola: 20734288 markings, 57143177 edges, 62954 markings/sec, 245 secs
lola: 21072701 markings, 58279931 edges, 67683 markings/sec, 250 secs
lola: 21525059 markings, 59648443 edges, 90472 markings/sec, 255 secs
lola: 21886342 markings, 60825389 edges, 72257 markings/sec, 260 secs
lola: 22184416 markings, 61883217 edges, 59615 markings/sec, 265 secs
lola: 22540484 markings, 62948802 edges, 71214 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((E (F ((AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + AvailableJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + Available... (shortened)
lola: processed formula length: 2438
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 568685 markings, 1160579 edges, 2486982876965371904 markings/sec, 0 secs
lola: 1017810 markings, 2183557 edges, 89825 markings/sec, 5 secs
lola: 1398164 markings, 3083328 edges, 76071 markings/sec, 10 secs
lola: 1876500 markings, 4036448 edges, 95667 markings/sec, 15 secs
lola: 2250017 markings, 4912157 edges, 74703 markings/sec, 20 secs
lola: 2659347 markings, 5849541 edges, 81866 markings/sec, 25 secs
lola: 3179640 markings, 6929058 edges, 104059 markings/sec, 30 secs
lola: 3545396 markings, 7832052 edges, 73151 markings/sec, 35 secs
lola: 4053639 markings, 8891624 edges, 101649 markings/sec, 40 secs
lola: 4487690 markings, 9859215 edges, 86810 markings/sec, 45 secs
lola: 4825833 markings, 10712576 edges, 67629 markings/sec, 50 secs
lola: 5326231 markings, 11751439 edges, 100080 markings/sec, 55 secs
lola: 5703886 markings, 12637787 edges, 75531 markings/sec, 60 secs
lola: 6098444 markings, 13532546 edges, 78912 markings/sec, 65 secs
lola: 6541901 markings, 14447405 edges, 88691 markings/sec, 70 secs
lola: 6884769 markings, 15305981 edges, 68574 markings/sec, 75 secs
lola: 7270397 markings, 16137998 edges, 77126 markings/sec, 80 secs
lola: 7662521 markings, 16950824 edges, 78425 markings/sec, 85 secs
lola: 7972798 markings, 17726828 edges, 62055 markings/sec, 90 secs
lola: 8359304 markings, 18588253 edges, 77301 markings/sec, 95 secs
lola: 8779616 markings, 19470986 edges, 84062 markings/sec, 100 secs
lola: 9096145 markings, 20294635 edges, 63306 markings/sec, 105 secs
lola: 9475279 markings, 21080759 edges, 75827 markings/sec, 110 secs
lola: 9843681 markings, 21835514 edges, 73680 markings/sec, 115 secs
lola: 10124972 markings, 22550730 edges, 56258 markings/sec, 120 secs
lola: 10508194 markings, 23382966 edges, 76644 markings/sec, 125 secs
lola: 10903560 markings, 24228010 edges, 79073 markings/sec, 130 secs
lola: 11207534 markings, 25016121 edges, 60795 markings/sec, 135 secs
lola: 11719212 markings, 26058914 edges, 102336 markings/sec, 140 secs
lola: 12114741 markings, 27005332 edges, 79106 markings/sec, 145 secs
lola: 12577674 markings, 28021380 edges, 92587 markings/sec, 150 secs
lola: 13037501 markings, 29054292 edges, 91965 markings/sec, 155 secs
lola: 13403712 markings, 29945015 edges, 73242 markings/sec, 160 secs
lola: 13800755 markings, 30761236 edges, 79409 markings/sec, 165 secs
lola: 14144835 markings, 31575791 edges, 68816 markings/sec, 170 secs
lola: 14656377 markings, 32634983 edges, 102308 markings/sec, 175 secs
lola: 15055735 markings, 33544182 edges, 79872 markings/sec, 180 secs
lola: 15436323 markings, 34328593 edges, 76118 markings/sec, 185 secs
lola: 15847229 markings, 35247128 edges, 82181 markings/sec, 190 secs
lola: 16328144 markings, 36299418 edges, 96183 markings/sec, 195 secs
lola: 16780954 markings, 37209566 edges, 90562 markings/sec, 200 secs
lola: 17121385 markings, 38021185 edges, 68086 markings/sec, 205 secs
lola: 17583401 markings, 38964846 edges, 92403 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + Perform_Work_B_1_17 + P... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(E(TRUE U (place_522_1 + 1 <= Perform_Work_B_1_0 + Perform_Work_B_1_1 + Perform_Work_B_1_2 + Perform_Work_B_1_3 + Perform_Work_B_1_4 + Perform_Work_B_1_5 + Perform_Work_B_1_6 + Perform_Work_B_1_7 + Perform_Work_B_1_8 + Perform_Work_B_1_9 + Perform_Work_B_1_10 + Perform_Work_B_1_11 + Perform_Work_B_1_12 + Perform_Work_B_1_13 + Perform_Work_B_1_14 + Perform_Work_B_1_15 + Perform_Work_B_1_16 + ... (shortened)
lola: processed formula length: 929
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: 545192 markings, 1379809 edges, 3225752436249460736 markings/sec, 0 secs
lola: 986635 markings, 2547875 edges, 88289 markings/sec, 5 secs
lola: 1305514 markings, 3601838 edges, 63776 markings/sec, 10 secs
lola: 1718205 markings, 4671737 edges, 82538 markings/sec, 15 secs
lola: 2131497 markings, 5730928 edges, 82658 markings/sec, 20 secs
lola: 2452027 markings, 6708663 edges, 64106 markings/sec, 25 secs
lola: 2805174 markings, 7748004 edges, 70629 markings/sec, 30 secs
lola: 3299273 markings, 8999482 edges, 98820 markings/sec, 35 secs
lola: 3678920 markings, 10118248 edges, 75929 markings/sec, 40 secs
lola: 4046655 markings, 11209139 edges, 73547 markings/sec, 45 secs
lola: 4530479 markings, 12427895 edges, 96765 markings/sec, 50 secs
lola: 4905423 markings, 13491471 edges, 74989 markings/sec, 55 secs
lola: 5201681 markings, 14445363 edges, 59252 markings/sec, 60 secs
lola: 5673794 markings, 15641233 edges, 94423 markings/sec, 65 secs
lola: 6064404 markings, 16722949 edges, 78122 markings/sec, 70 secs
lola: 6356536 markings, 17678642 edges, 58426 markings/sec, 75 secs
lola: 6777638 markings, 18739283 edges, 84220 markings/sec, 80 secs
lola: 7163180 markings, 19750151 edges, 77108 markings/sec, 85 secs
lola: 7453840 markings, 20689202 edges, 58132 markings/sec, 90 secs
lola: 7778102 markings, 21588484 edges, 64852 markings/sec, 95 secs
lola: 8137429 markings, 22498075 edges, 71865 markings/sec, 100 secs
lola: 8460536 markings, 23379102 edges, 64621 markings/sec, 105 secs
lola: 8706714 markings, 24199423 edges, 49236 markings/sec, 110 secs
lola: 9071878 markings, 25179067 edges, 73033 markings/sec, 115 secs
lola: 9450027 markings, 26156746 edges, 75630 markings/sec, 120 secs
lola: 9742212 markings, 27073933 edges, 58437 markings/sec, 125 secs
lola: 10034200 markings, 27923138 edges, 58398 markings/sec, 130 secs
lola: 10374348 markings, 28780761 edges, 68030 markings/sec, 135 secs
lola: 10683350 markings, 29596571 edges, 61800 markings/sec, 140 secs
lola: 10926790 markings, 30384803 edges, 48688 markings/sec, 145 secs
lola: 11209987 markings, 31217317 edges, 56639 markings/sec, 150 secs
lola: 11593667 markings, 32191845 edges, 76736 markings/sec, 155 secs
lola: 11918898 markings, 33130398 edges, 65046 markings/sec, 160 secs
lola: 12174094 markings, 33964297 edges, 51039 markings/sec, 165 secs
lola: 12647880 markings, 35158670 edges, 94757 markings/sec, 170 secs
lola: 13023080 markings, 36224046 edges, 75040 markings/sec, 175 secs
lola: 13325852 markings, 37187394 edges, 60554 markings/sec, 180 secs
lola: 13819918 markings, 38439300 edges, 98813 markings/sec, 185 secs
lola: 14183692 markings, 39507670 edges, 72755 markings/sec, 190 secs
lola: 14507160 markings, 40486408 edges, 64694 markings/sec, 195 secs
lola: 14864337 markings, 41387617 edges, 71435 markings/sec, 200 secs
lola: 15172803 markings, 42215731 edges, 61693 markings/sec, 205 secs
lola: 15556325 markings, 43290411 edges, 76704 markings/sec, 210 secs
lola: 15979956 markings, 44439945 edges, 84726 markings/sec, 215 secs
lola: 16330589 markings, 45404204 edges, 70127 markings/sec, 220 secs
lola: 16673107 markings, 46286516 edges, 68504 markings/sec, 225 secs
lola: 16948772 markings, 47124835 edges, 55133 markings/sec, 230 secs
lola: 17407826 markings, 48287481 edges, 91811 markings/sec, 235 secs
lola: 17768496 markings, 49334536 edges, 72134 markings/sec, 240 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 558 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Perform_Work_E_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((Perform_Work_E_1 <= 0))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 11 will run for 558 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT(A (((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 558 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NotifyEventJobQueuedE_1 + 1 <= place_462) R (f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9 + 1 <= NotifyEventEndOfCheckSource... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((place_462 <= NotifyEventJobQueuedE_1) U (NotifyEventEndOfCheckSourcesB_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))... (shortened)
lola: processed formula length: 401
lola: 7 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 12 will run for 698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_31 + f3_32 + f3_33 + f3_34 + f3_35 + f3_36 + f3_37 + f3_38 + f3_39 + f3_40 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))
lola: processed formula length: 332
lola: 5 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 698 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= Try_Check_Sources_B_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= Try_Check_Sources_B_1)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 931 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((mi2 <= Check_Sources_B_1) AND (mo2 <= NotifyEventEndOfCheckSourcesB_1))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((Check_Sources_B_1 + 1 <= mi2) OR (NotifyEventEndOfCheckSourcesB_1 + 1 <= mo2)))))
lola: processed formula length: 106
lola: 3 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 14 will run for 1396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1396 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + QueueJobB_1_22 + Q... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_1_7 + QueueJobB_1_8 + QueueJobB_1_9 + QueueJobB_1_10 + QueueJobB_1_11 + QueueJobB_1_12 + QueueJobB_1_13 + QueueJobB_1_14 + QueueJobB_1_15 + QueueJobB_1_16 + QueueJobB_1_17 + QueueJobB_1_18 + QueueJobB_1_19 + QueueJobB_1_20 + QueueJobB_1_21 + Queu... (shortened)
lola: processed formula length: 721
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: subprocess 15 will run for 2793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 <= mo3))
lola: processed formula length: 80
lola: 1 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + AvailableJ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= AvailableJobId_10 + AvailableJobId_11 + AvailableJobId_12 + AvailableJobId_13 + AvailableJobId_14 + AvailableJobId_15 + AvailableJobId_22 + AvailableJobId_23 + AvailableJobId_24 + AvailableJobId_25 + AvailableJobId_26 + AvailableJobId_27 + AvailableJobId_28 + AvailableJobId_35 + AvailableJobId_36 + AvailableJobId_37 + AvailableJobId_38 + AvailableJobId_39 + AvailableJobId_9 + AvailableJob... (shortened)
lola: processed formula length: 1258
lola: 2 rewrites
lola: formula mentions 0 of 629 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S05J40-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 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: RESULT
lola:
SUMMARY: no no yes no no no no no unknown unknown unknown no no yes no no
lola: ========================================
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S05J40-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494713289013

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="CTLCardinality"
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/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is PolyORBNT-PT-S05J40, 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 r058-smll-149440926100111"
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 ;