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

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

=== Now, execution of the tool begins

BK_START 1463740670126

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBNT-PT-S05J20
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J20-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J20-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: 1559/65536 symbol table entries, 146 collisions
lola: preprocessing...
lola: finding significant places
lola: 349 places, 1210 transitions, 287 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 668 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J20-ReachabilityCardinality.task
lola: read: AG (!(1 <= FetchJobE_1_16 + FetchJobE_1_4 + FetchJobE_1_17 + FetchJobE_1_11 + FetchJobE_1_18 + FetchJobE_1_5 + FetchJobE_1_10 + FetchJobE_1_19 + FetchJobE_1_2 + FetchJobE_1_12 + FetchJobE_1_3 + FetchJobE_1_0 + FetchJobE_1_7 + FetchJobE_1_1 + FetchJobE_1_13 + FetchJobE_1_20 + FetchJobE_1_6 + FetchJobE_1_14 + FetchJobE_1_9 + FetchJobE_1_15 + FetchJobE_1_8)) : EF (1 <= NotifyEventEndOfCheckSourcesB_1... (shortened)
lola: formula length: 10585
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-FetchJobE_1_20 + -FetchJobE_1_19 + -FetchJobE_1_18 + -FetchJobE_1_17 + -FetchJobE_1_16 + -FetchJobE_1_15 + -FetchJobE_1_14 + -FetchJobE_1_13 + -FetchJobE_1_12 + -FetchJobE_1_11 + -FetchJobE_1_10 + -FetchJobE_1_9 + -FetchJobE_1_8 + -FetchJobE_1_7 + -FetchJobE_1_6 + -FetchJobE_1_5 + -FetchJobE_1_4 + -FetchJobE_1_3 + -FetchJobE_1_2 + -FetchJobE_1_1 + -FetchJobE_1_0 > -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 1148 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-S05J20-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality.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 1 will run for 235 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 1148 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-S05J20-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((CreatedJobs_15_5 + CreatedJobs_15_4 + CreatedJobs_15_3 + CreatedJobs_15_2 + CreatedJobs_15_1 + CreatedJobs_10_5 + CreatedJobs_11_5 + CreatedJobs_14_5 + -FetchJobB_1 + CreatedJobs_13_5 + CreatedJobs_12_5 + CreatedJobs_12_4 + CreatedJobs_12_3 + CreatedJobs_12_2 + CreatedJobs_12_1 + CreatedJobs_13_1 + CreatedJobs_13_2 + CreatedJobs_13_3 + CreatedJobs_13_4 + CreatedJobs_14_1 + CreatedJobs_14_2 +... (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 1148 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 6 literals
lola: write sara problem file to PolyORBNT-COL-S05J20-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-2.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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Perform_Work_E_1 <= -3 AND (-place_522_1 <= -1 AND (-QueueJobE_1 <= -3 OR -DataOnSrc_5 + -DataOnSrc_4 + -DataOnSrc_3 + -DataOnSrc_2 + -DataOnSrc_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 1148 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 6 literals
lola: write sara problem file to PolyORBNT-COL-S05J20-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-3.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 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-mo2 + place_518_1 > 0 OR (-place_458 > -3 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_20 + -NotifyEventJobQueuedB_1_10 ... (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 1148 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-S05J20-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-4.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 5 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-mo3 + QueueJobB_1_20 + QueueJobB_1_19 + QueueJobB_1_18 + QueueJobB_1_17 + QueueJobB_1_16 + QueueJobB_1_15 + QueueJobB_1_14 + QueueJobB_1_13 + QueueJobB_1_12 + QueueJobB_1_11 + QueueJobB_1_10 + QueueJobB_1_9 + QueueJobB_1_8 + QueueJobB_1_7 + QueueJobB_1_6 + QueueJobB_1_5 + QueueJobB_1_4 + QueueJobB_1_3 + QueueJobB_1_2 + QueueJobB_1_1 + QueueJobB_1_0 <= 0 AND (-place_456 <= -1 AND (-QueueJobE_... (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 1148 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 6 literals
lola: write sara problem file to PolyORBNT-COL-S05J20-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-5.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 6 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-CanInjectEvent <= -3)
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 1148 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-S05J20-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((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_PerformWork_9 + Schedule_Task_E_1_CheckSource_0 + Schedule_Task_E_1_Per... (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 1148 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-S05J20-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((place_782_1 + -TheSour_5 + -TheSour_4 + -TheSour_3 + -TheSour_2 + -TheSour_1 <= 0 OR (NotifyEventEndOfCheckSourcesB_1 + -place_456 <= 0 OR (-cJobCnt > -2 OR -JobCnt + place_787_1 <= 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 1148 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-S05J20-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-mo1 <= -3 AND (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_20 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_11 + NotifyEventJ... (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 1148 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-S05J20-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-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 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-place_521_1 > -1 AND -Try_Check_Sources_E_1 + place_520_1 <= 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 1148 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-S05J20-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 433 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-f1_20 + -f1_19 + -f1_18 + -f1_17 + -f1_16 + -f1_15 + -f1_14 + -f1_13 + -f1_12 + -f1_11 + -f1_10 + -f1_9 + -f1_8 + -f1_7 + -f1_6 + -f1_5 + -f1_4 + -f1_3 + -f1_2 + -f1_1 + -f1_0 > -3 AND FetchJobB_1 + -NotifyEventEndOfCheckSourcesE_1 <= 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 1148 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-S05J20-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (place_782_1 + -block > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1148 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-S05J20-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 721 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (place_782_1 + -AvailableJobId_16 + -AvailableJobId_17 + -AvailableJobId_18 + -AvailableJobId_19 + -AvailableJobId_20 + -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 + -AvailableJobId_7 + -AvailableJobId_8 + -AvailableJobId_9 + -AvailableJobId_15 + -AvailableJobId_14 + -AvailableJobId_13 + -AvailableJobI... (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 1148 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-S05J20-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-13.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 14 will run for 722 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-mi3 + place_521_1 <= 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 1148 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-S05J20-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 1444 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 + -NotifyEventJobQueuedB_1_20 + place_518_1 + -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 1148 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 10 literals
lola: write sara problem file to PolyORBNT-COL-S05J20-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J20-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: no yes unknown unknown unknown unknown no no yes unknown no no yes unknown no yes

BK_STOP 1463742769178

--------------------
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-S05J20"
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-S05J20.tgz
mv PolyORBNT-PT-S05J20 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-S05J20, 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-146369089200916"
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 ;