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-2979
Executing tool lola
Input is S_PolyORBNT-PT-S05J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433135401488
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464526324615

bkconf 3600
===========================================================================================
===========================================================================================
S_PolyORBNT-PT-S05J80: translating Petri net model.pnml into LoLA format
S_PolyORBNT-PT-S05J80: translating formula CTLCardinality into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
/home/mcc/BenchKit/bin/formula2lola.py CTLCardinality.xml
touch formulae;


in benchkit_head lolaszeit 3532
CTLCardinality @ S_PolyORBNT-PT-S05J80
Makefile:76: recipe for target 'verify' failed
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-CTLCardinality-15 CANNOT_COMPUTE
lola: LoLA will run for 3532 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3539/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 1189 places, 2350 transitions, 1007 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J80-CTLCardinality.task
lola: read: EF ((((1 <= mo1 AND AvailableJobId_53 + AvailableJobId_28 + AvailableJobId_74 + AvailableJobId_35 + AvailableJobId_45 + AvailableJobId_8 + AvailableJobId_55 + AvailableJobId_36 + AvailableJobId_17 + AvailableJobId_27 + AvailableJobId_18 + AvailableJobId_73 + AvailableJobId_64 + AvailableJobId_75 + AvailableJobId_40 + AvailableJobId_26 + AvailableJobId_54 + AvailableJobId_19 + AvailableJobId_12 + A... (shortened)
lola: formula length: 49931
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-mo1 <= -1 AND (AvailableJobId_16 + AvailableJobId_17 + AvailableJobId_18 + AvailableJobId_19 + AvailableJobId_20 + AvailableJobId_21 + AvailableJobId_29 + AvailableJobId_30 + AvailableJobId_31 + AvailableJobId_32 + AvailableJobId_33 + AvailableJobId_34 + AvailableJobId_40 + AvailableJobId_41 + AvailableJobId_42 + AvailableJobId_43 + AvailableJobId_44 + AvailableJobId_45 + AvailableJobId_46 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + -Check_Sources_E_1 <= 0 AND EG (AX (-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Sc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 + ModifiedSrc_1 + -Check_Sources_E_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_CheckSource_0 + QueueJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_CheckSource_0 +... (shortened)
lola: processed formula length: 2977
lola: 491781 rewrites
lola: formula mentions 83 of 1189 places; total mentions: 83
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-place_518_1 > -2 OR (-Check_Sources_B_1 > -1 OR (NotifyEventJobQueuedB_1_9 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_80 + NotifyEventJobQueuedB_1_10 + NotifyE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((mi1 + -place_462 > 0 AND AvailableJobId_16 + AvailableJobId_17 + AvailableJobId_18 + AvailableJobId_19 + AvailableJobId_20 + AvailableJobId_21 + AvailableJobId_29 + AvailableJobId_30 + AvailableJobId_31 + AvailableJobId_32 + AvailableJobId_33 + AvailableJobId_34 + AvailableJobId_40 + AvailableJobId_41 + AvailableJobId_42 + AvailableJobId_43 + AvailableJobId_44 + AvailableJobId_45 + Available... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-CanInjectEvent > -1 OR (DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + -f2_80 + -f2_79 + -f2_78 + -f2_77 + -f2_76 + -f2_75 + -f2_74 + -f2_73 + -f2_72 + -f2_71 + -f2_70 + -f2_69 + -f2_68 + -f2_67 + -f2_66 + -f2_65 + -f2_64 + -f2_63 + -f2_62 + -f2_61 + -f2_60 + -f2_59 + -f2_58 + -f2_57 + -f2_56 + -f2_55 + -f2_54 + -f2_53 + -f2_52 + -f2_51 + -f2_50 + -f2_49 + -f2_48 + -f2_47... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-CanInjectEvent > -1 OR (DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + -f2_80 + -f2_79 + -f2_78 + -f2_77 + -f2_76 + -f2_75 + -f2_74 + -f2_73 + -f2_72 + -f2_71 + -f2_70 + -f2_69 + -f2_68 + -f2_67 + -f2_66 + -f2_65 + -f2_64 + -f2_63 + -f2_62 + -f2_61 + -f2_60 + -f2_59 + -f2_58 + -f2_57 + -f2_56 + -f2_55 + -f2_54 + -f2_53 + -f2_52 + -f2_51 + -f2_50 + -f2_49 + -f2_48 + -f2_47 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 4 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cJobCnt + mo2 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
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 5 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-f1_80 + -f1_79 + -f1_78 + -f1_77 + -f1_76 + -f1_75 + -f1_74 + -f1_73 + -f1_72 + -f1_71 + -f1_70 + -f1_69 + -f1_68 + -f1_67 + -f1_66 + -f1_65 + -f1_64 + -f1_63 + -f1_62 + -f1_61 + -f1_60 + -f1_59 + -f1_58 + -f1_57 + -f1_56 + -f1_55 + -f1_54 + -f1_53 + -f1_52 + -f1_51 + -f1_50 + -f1_49 + -f1_48 + -f1_47 + -f1_46 + -f1_45 + -f1_44 + -f1_43 + -f1_42 + -f1_41 + -f1_40 + -f1_39 + -f1_38 + -f1_37 + -f... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-f1_80 + -f1_79 + -f1_78 + -f1_77 + -f1_76 + -f1_75 + -f1_74 + -f1_73 + -f1_72 + -f1_71 + -f1_70 + -f1_69 + -f1_68 + -f1_67 + -f1_66 + -f1_65 + -f1_64 + -f1_63 + -f1_62 + -f1_61 + -f1_60 + -f1_59 + -f1_58 + -f1_57 + -f1_56 + -f1_55 + -f1_54 + -f1_53 + -f1_52 + -f1_51 + -f1_50 + -f1_49 + -f1_48 + -f1_47 + -f1_46 + -f1_45 + -f1_44 + -f1_43 + -f1_42 + -f1_41 + -f1_40 + -f1_39 + -f1_38 + -f1_37 + -f... (shortened)
lola: processed formula length: 757
lola: 491780 rewrites
lola: formula mentions 83 of 1189 places; total mentions: 83
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-place_787_1 > -1) OR EG (-place_462 > -2)) AND EF (((place_482_1_5 + place_482_1_4 + place_482_1_3 + place_482_1_2 + place_482_1_1 + -place_456 <= 0 OR -Perform_Work_B_1_80 + -Perform_Work_B_1_79 + -Perform_Work_B_1_78 + -Perform_Work_B_1_77 + -Perform_Work_B_1_76 + -Perform_Work_B_1_75 + -Perform_Work_B_1_74 + -Perform_Work_B_1_73 + -Perform_Work_B_1_72 + -Perform_Work_B_1_71 + -Perform_Wo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-place_787_1 > -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-place_462 > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-place_462 > -2)))
lola: processed formula length: 31
lola: 491780 rewrites
lola: formula mentions 1 of 1189 places; total mentions: 1
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((place_482_1_5 + place_482_1_4 + place_482_1_3 + place_482_1_2 + place_482_1_1 + -place_456 <= 0 OR -Perform_Work_B_1_80 + -Perform_Work_B_1_79 + -Perform_Work_B_1_78 + -Perform_Work_B_1_77 + -Perform_Work_B_1_76 + -Perform_Work_B_1_75 + -Perform_Work_B_1_74 + -Perform_Work_B_1_73 + -Perform_Work_B_1_72 + -Perform_Work_B_1_71 + -Perform_Work_B_1_70 + -Perform_Work_B_1_69 + -Perform_Work_B_1_6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((cJobCnt + -place_523_1 <= 0 OR (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 <= -2 OR (place_782_1 + -NotifyEventEndOfCheckSourcesE_1 <= 0 OR CreatedJobs_51_5 + CreatedJobs_51_4 + CreatedJobs_51_3 + CreatedJobs_51_2 + CreatedJobs_51_1 + CreatedJobs_64_5 + CreatedJobs_77_5 + CreatedJobs_70_5 + CreatedJobs_48_5 + CreatedJobs_35_5 + CreatedJobs_22_5 + CreatedJobs_71_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((cJobCnt + -place_523_1 <= 0 OR (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 <= -2 OR (place_782_1 + -NotifyEventEndOfCheckSourcesE_1 <= 0 OR CreatedJobs_51_5 + CreatedJobs_51_4 + CreatedJobs_51_3 + CreatedJobs_51_2 + CreatedJobs_51_1 + CreatedJobs_64_5 + CreatedJobs_77_5 + CreatedJobs_70_5 + CreatedJobs_48_5 + CreatedJobs_35_5 + CreatedJobs_22_5 + CreatedJobs_71_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((cJobCnt + -place_523_1 <= 0 OR (-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 <= -2 OR (place_782_1 + -NotifyEventEndOfCheckSourcesE_1 <= 0 OR CreatedJobs_51_5 + CreatedJobs_51_4 + CreatedJobs_51_3 + CreatedJobs_51_2 + CreatedJobs_51_1 + CreatedJobs_64_5 + CreatedJobs_77_5 + CreatedJobs_70_5 + CreatedJobs_48_5 + CreatedJobs_35_5 + CreatedJobs_22_5 + Created... (shortened)
lola: processed formula length: 7850
lola: 491780 rewrites
lola: formula mentions 415 of 1189 places; total mentions: 415
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((mo2 + -QueueJobB_1_80 + -QueueJobB_1_79 + -QueueJobB_1_78 + -QueueJobB_1_77 + -QueueJobB_1_76 + -QueueJobB_1_75 + -QueueJobB_1_74 + -QueueJobB_1_73 + -QueueJobB_1_72 + -QueueJobB_1_71 + -QueueJobB_1_70 + -QueueJobB_1_69 + -QueueJobB_1_68 + -QueueJobB_1_67 + -QueueJobB_1_66 + -QueueJobB_1_65 + -QueueJobB_1_64 + -QueueJobB_1_63 + -QueueJobB_1_62 + -QueueJobB_1_61 + -QueueJobB_1_60 + -QueueJobB_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((mo2 + -QueueJobB_1_80 + -QueueJobB_1_79 + -QueueJobB_1_78 + -QueueJobB_1_77 + -QueueJobB_1_76 + -QueueJobB_1_75 + -QueueJobB_1_74 + -QueueJobB_1_73 + -QueueJobB_1_72 + -QueueJobB_1_71 + -QueueJobB_1_70 + -QueueJobB_1_69 + -QueueJobB_1_68 + -QueueJobB_1_67 + -QueueJobB_1_66 + -QueueJobB_1_65 + -QueueJobB_1_64 + -QueueJobB_1_63 + -QueueJobB_1_62 + -QueueJobB_1_61 + -QueueJobB_1_60 + -QueueJobB_1_... (shortened)
lola: processed formula length: 4073
lola: 491780 rewrites
lola: formula mentions 251 of 1189 places; total mentions: 251
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-QueueJobB_1_80 + -QueueJobB_1_79 + -QueueJobB_1_78 + -QueueJobB_1_77 + -QueueJobB_1_76 + -QueueJobB_1_75 + -QueueJobB_1_74 + -QueueJobB_1_73 + -QueueJobB_1_72 + -QueueJobB_1_71 + -QueueJobB_1_70 + -QueueJobB_1_69 + -QueueJobB_1_68 + -QueueJobB_1_67 + -QueueJobB_1_66 + -QueueJobB_1_65 + -QueueJobB_1_64 + -QueueJobB_1_63 + -QueueJobB_1_62 + -QueueJobB_1_61 + -QueueJobB_1_60 + -QueueJobB_1_59 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-QueueJobB_1_80 + -QueueJobB_1_79 + -QueueJobB_1_78 + -QueueJobB_1_77 + -QueueJobB_1_76 + -QueueJobB_1_75 + -QueueJobB_1_74 + -QueueJobB_1_73 + -QueueJobB_1_72 + -QueueJobB_1_71 + -QueueJobB_1_70 + -QueueJobB_1_69 + -QueueJobB_1_68 + -QueueJobB_1_67 + -QueueJobB_1_66 + -QueueJobB_1_65 + -QueueJobB_1_64 + -QueueJobB_1_63 + -QueueJobB_1_62 + -QueueJobB_1_61 + -QueueJobB_1_60 + -QueueJobB_1_59 + -... (shortened)
lola: processed formula length: 1726
lola: 491780 rewrites
lola: formula mentions 91 of 1189 places; total mentions: 96
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 362 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-place_522_1 + place_520_1 <= 0 AND -place_458 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-place_522_1 + place_520_1 <= 0 AND -place_458 > -2))))
lola: processed formula length: 69
lola: 491780 rewrites
lola: formula mentions 3 of 1189 places; total mentions: 3
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-mi3 <= -2 OR (AG (-mo1 <= -3) OR EG (AX (-Schedule_Task_B_1 + place_523_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -mi3 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-mo1 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AX (-Schedule_Task_B_1 + place_523_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(AX(-Schedule_Task_B_1 + place_523_1 <= 0))))
lola: processed formula length: 57
lola: 491781 rewrites
lola: formula mentions 2 of 1189 places; total mentions: 2
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-cJobCnt <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -cJobCnt <= -2))))
lola: processed formula length: 40
lola: 491781 rewrites
lola: formula mentions 1 of 1189 places; total mentions: 1
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AF (-mi1 + NotifyEventJobQueuedE_1 <= 0) U -place_523_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U -mi1 + NotifyEventJobQueuedE_1 <= 0) U -place_523_1 <= -2)
lola: processed formula length: 69
lola: 491781 rewrites
lola: formula mentions 3 of 1189 places; total mentions: 3
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-Try_Check_Sources_E_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -Try_Check_Sources_E_1 <= -1))))
lola: processed formula length: 54
lola: 491781 rewrites
lola: formula mentions 1 of 1189 places; total mentions: 1
lola: closed formula file PolyORBNT-COL-S05J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4028 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
Killed

BK_STOP 1464527599937

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

parsing of model.pnml complete
make: [verify] Error 137 (ignored)

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="S_PolyORBNT-PT-S05J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/S_PolyORBNT-PT-S05J80.tgz
mv S_PolyORBNT-PT-S05J80 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is S_PolyORBNT-PT-S05J80, 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 r170kn-ebro-146433135401488"
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 ;