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 PolyORBNT-PT-S05J80, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089200952
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463744559389

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBNT-PT-S05J80
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 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-ReachabilityCardinality.task
lola: read: EF (((!(Schedule_Task_B_1 <= mo2) AND !(NotifyEventEndOfCheckSourcesE_1 <= place_520_1)) OR !((Perform_Work_E_1 <= Try_Check_Sources_E_1 AND QueueJobB_1_8 + QueueJobB_1_45 + QueueJobB_1_18 + QueueJobB_1_27 + QueueJobB_1_36 + QueueJobB_1_63 + QueueJobB_1_16 + QueueJobB_1_51 + QueueJobB_1_71 + QueueJobB_1_2 + QueueJobB_1_23 + QueueJobB_1_64 + QueueJobB_1_79 + QueueJobB_1_44 + QueueJobB_1_9 + QueueJo... (shortened)
lola: formula length: 29522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-mo2 + Schedule_Task_B_1 > 0 AND NotifyEventEndOfCheckSourcesE_1 + -place_520_1 > 0) OR (Perform_Work_E_1 + -Try_Check_Sources_E_1 > 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 + -Pe... (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 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-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 + -NotifyEventJobQueuedB_1_11 + -NotifyEventJob... (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 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + QueueJobE_1 <= 0 AND (-mi1 + 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 + f2_46 + f2_45 + f2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-NotifyEventEndOfCheckSourcesB_1 <= -1 OR -Check_Sources_B_1 + 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 + QueueJo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 5 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-QueueJobE_1 + place_462 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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 + f1_36 + f1_35 + f1_34 + f1_33 + f1_32 + f1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NotifyEventJobQueuedE_1 <= -2 AND (-Try_Check_Sources_B_1 > -2 AND mi1 + -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... (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 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-FetchJobE_1_80 + -FetchJobE_1_79 + -FetchJobE_1_78 + -FetchJobE_1_77 + -FetchJobE_1_76 + -FetchJobE_1_75 + -FetchJobE_1_74 + -FetchJobE_1_73 + -FetchJobE_1_72 + -FetchJobE_1_71 + -FetchJobE_1_70 + -FetchJobE_1_69 + -FetchJobE_1_68 + -FetchJobE_1_67 + -FetchJobE_1_66 + -FetchJobE_1_65 + -FetchJobE_1_64 + -FetchJobE_1_63 + -FetchJobE_1_62 + -FetchJobE_1_61 + -FetchJobE_1_60 + -FetchJobE_1_59 ... (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 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: Transformation into DNF: expect 12 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (FetchJobE_1_80 + FetchJobE_1_79 + FetchJobE_1_78 + FetchJobE_1_77 + FetchJobE_1_76 + FetchJobE_1_75 + FetchJobE_1_74 + FetchJobE_1_73 + FetchJobE_1_72 + FetchJobE_1_71 + FetchJobE_1_70 + FetchJobE_1_69 + FetchJobE_1_68 + FetchJobE_1_67 + FetchJobE_1_66 + FetchJobE_1_65 + FetchJobE_1_64 + FetchJobE_1_63 + FetchJobE_1_62 + FetchJobE_1_61 + FetchJobE_1_60 + FetchJobE_1_59 + FetchJobE_1_58 + Fetch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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 + -QueueJobB_1_80 + -Qu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cJobCnt <= -2 OR -place_460 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-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 + place_782_1 + -NotifyEventJobQueuedB_1_80 + -NotifyEventJobQueuedB_1_10 + -NotifyEventJobQueuedB_1_11 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-mo1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-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 + -f2_46 + -f2_45 + -f2_44 + -f2_43 + -f2_42 + -f2_41 + -f2_40 + -f2_39 + -f2_38 + -f2_37 + ... (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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (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 + f1_36 + f1_35 + f1_34 + f1_33 + f1_32 + f1_3... (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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-NotifyEventEndOfCheckSourcesB_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 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J80-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J80-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes unknown no no no no unknown unknown no unknown unknown unknown unknown yes unknown yes

BK_STOP 1463747534174

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J80"
export BK_EXAMINATION="ReachabilityCardinality"
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/PolyORBNT-PT-S05J80.tgz
mv 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 PolyORBNT-PT-S05J80, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086kn-ebro-146369089200952"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;