About the Execution of LoLa for MAPK-PT-320
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15937.730 | 1121651.00 | 1119584.00 | 601.40 | ??TFF?FFT?T???FT | normal |
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 MAPK-PT-320, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358897000346
=====================================================================
--------------------
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 MAPK-PT-320-CTLFireability-0
FORMULA_NAME MAPK-PT-320-CTLFireability-1
FORMULA_NAME MAPK-PT-320-CTLFireability-10
FORMULA_NAME MAPK-PT-320-CTLFireability-11
FORMULA_NAME MAPK-PT-320-CTLFireability-12
FORMULA_NAME MAPK-PT-320-CTLFireability-13
FORMULA_NAME MAPK-PT-320-CTLFireability-14
FORMULA_NAME MAPK-PT-320-CTLFireability-15
FORMULA_NAME MAPK-PT-320-CTLFireability-2
FORMULA_NAME MAPK-PT-320-CTLFireability-3
FORMULA_NAME MAPK-PT-320-CTLFireability-4
FORMULA_NAME MAPK-PT-320-CTLFireability-5
FORMULA_NAME MAPK-PT-320-CTLFireability-6
FORMULA_NAME MAPK-PT-320-CTLFireability-7
FORMULA_NAME MAPK-PT-320-CTLFireability-8
FORMULA_NAME MAPK-PT-320-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1463613763390
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ MAPK-PT-320
FORMULA MAPK-PT-320-CTLFireability-0 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-1 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-3 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-5 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-6 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-7 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-13 CANNOT_COMPUTE
FORMULA MAPK-PT-320-CTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA MAPK-PT-320-CTLFireability-15 FALSE 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-320-CTLFireability.task
lola: read: !(AG (EF ((FIREABLE(k15) AND FIREABLE(k13))))) : (EG ((EF (FIREABLE(k16)) AND EG (FIREABLE(k2)))) OR (!((!((FIREABLE(k18) AND FIREABLE(k24))) AND AG (FIREABLE(k8)))) AND EF (AG (FIREABLE(k17))))) : !(AG (!(!((FIREABLE(k29) OR FIREABLE(k1)))))) : E(EF ((FIREABLE(k29) OR FIREABLE(k13))) U (AG (FIREABLE(k5)) AND FIREABLE(k29))) : E((!((FIREABLE(k6) OR FIREABLE(k25))) AND (!(FIREABLE(k8)) OR (FIREABLE... (shortened)
lola: formula length: 1267
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 (AG ((! FIREABLE(k15) OR ! FIREABLE(k13))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((! FIREABLE(k15) OR ! FIREABLE(k13))))))
lola: processed formula length: 62
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG ((EF (FIREABLE(k16)) AND EG (FIREABLE(k2)))) OR (((FIREABLE(k18) AND FIREABLE(k24)) OR EF (! FIREABLE(k8))) AND EF (AG (FIREABLE(k17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EF (FIREABLE(k16)) AND EG (FIREABLE(k2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((E(TRUE U FIREABLE(k16)) AND !(A(TRUE U !(FIREABLE(k2))))))))
lola: processed formula length: 74
lola: 80 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(k18) AND FIREABLE(k24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (! FIREABLE(k8))
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 60 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: subprocess 4 will run for 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (FIREABLE(k17)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(FIREABLE(k17)))))
lola: processed formula length: 39
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(k29) AND ! FIREABLE(k1)))
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 60 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: subprocess 3 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF ((FIREABLE(k29) OR FIREABLE(k13))) U (AG (FIREABLE(k5)) AND FIREABLE(k29)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (FIREABLE(k29) OR FIREABLE(k13))) U (!(E(TRUE U !(FIREABLE(k5)))) AND FIREABLE(k29)))
lola: processed formula length: 96
lola: 80 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((! FIREABLE(k6) AND (! FIREABLE(k25) AND (! FIREABLE(k8) OR (FIREABLE(k21) AND FIREABLE(k8))))) U AX (! FIREABLE(k1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((! FIREABLE(k6) AND (! FIREABLE(k25) AND (! FIREABLE(k8) OR (FIREABLE(k21) AND FIREABLE(k8))))) U AX(! FIREABLE(k1)))
lola: processed formula length: 119
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 5 will run for 268 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (! FIREABLE(k19)) U AG ((FIREABLE(k1) OR FIREABLE(k13))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U ! FIREABLE(k19)) U !(E(TRUE U !((FIREABLE(k1) OR FIREABLE(k13))))))
lola: processed formula length: 78
lola: 80 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((EF (! FIREABLE(k18)) OR ((FIREABLE(k20) OR FIREABLE(k17)) AND ((FIREABLE(k22) OR FIREABLE(k22)) AND EF (FIREABLE(k23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((E(TRUE U ! FIREABLE(k18)) OR ((FIREABLE(k20) OR FIREABLE(k17)) AND ((FIREABLE(k22) OR FIREABLE(k22)) AND E(TRUE U FIREABLE(k23))))))))
lola: processed formula length: 148
lola: 80 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (((FIREABLE(k16) AND FIREABLE(k7)) OR ! FIREABLE(k29))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(((FIREABLE(k16) AND FIREABLE(k7)) OR ! FIREABLE(k29))))))
lola: processed formula length: 79
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 314 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AX (AG (FIREABLE(k16))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(AX(!(E(TRUE U !(FIREABLE(k16))))))))
lola: processed formula length: 49
lola: 80 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((! FIREABLE(k13) OR (! FIREABLE(k7) OR (! FIREABLE(k5) AND ! FIREABLE(k18)))) AND ((! FIREABLE(k21) OR (! FIREABLE(k23) AND ! FIREABLE(k7))) AND (! FIREABLE(k13) AND (! FIREABLE(k22) OR ! FIREABLE(k11)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (((FIREABLE(k12) OR FIREABLE(k30)) AND ! FIREABLE(k2))) OR (EX (AX (FIREABLE(k11))) OR (EX (! FIREABLE(k24)) AND EF ((! FIREABLE(k16) OR ! FIREABLE(k4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(k12) OR FIREABLE(k30)) AND ! FIREABLE(k2)))
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 60 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 11 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AX (FIREABLE(k11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(FIREABLE(k11)))
lola: processed formula length: 21
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (! FIREABLE(k24))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(! FIREABLE(k24))
lola: processed formula length: 19
lola: 78 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(k16) OR ! FIREABLE(k4)))
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 60 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 11 will run for 502 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 628 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(FIREABLE(k22) U FIREABLE(k8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(FIREABLE(k22) U FIREABLE(k8)))
lola: processed formula length: 35
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 13 will run for 838 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (! FIREABLE(k6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(! FIREABLE(k6)))))
lola: processed formula length: 34
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 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 14 will run for 1209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (EX ((FIREABLE(k7) AND FIREABLE(k12)))) OR FIREABLE(k14))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EX ((FIREABLE(k7) AND FIREABLE(k12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(EX((FIREABLE(k7) AND FIREABLE(k12))))
lola: processed formula length: 40
lola: 79 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 60 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: subprocess 15 will run for 2419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: lola: processed formula with 0 atomic propositions
========================================
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(k24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file MAPK-PT-320-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: RESULT
lola: summary: unknown unknown yes unknown yes unknown unknown unknown no yes yes no no unknown no no
BK_STOP 1463614885041
--------------------
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="MAPK-PT-320"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/MAPK-PT-320.tgz
mv MAPK-PT-320 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 MAPK-PT-320, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r062kn-blw3-146358897000346"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
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 ;