About the Execution of LoLa for UtahNoC-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15952.250 | 3317543.00 | 3324246.00 | 7995.50 | ?F?TFFT?????T??F | 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 UtahNoC-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r134kn-smll-146384395500157
=====================================================================
--------------------
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 UtahNoC-PT-none-CTLFireability-0
FORMULA_NAME UtahNoC-PT-none-CTLFireability-1
FORMULA_NAME UtahNoC-PT-none-CTLFireability-10
FORMULA_NAME UtahNoC-PT-none-CTLFireability-11
FORMULA_NAME UtahNoC-PT-none-CTLFireability-12
FORMULA_NAME UtahNoC-PT-none-CTLFireability-13
FORMULA_NAME UtahNoC-PT-none-CTLFireability-14
FORMULA_NAME UtahNoC-PT-none-CTLFireability-15
FORMULA_NAME UtahNoC-PT-none-CTLFireability-2
FORMULA_NAME UtahNoC-PT-none-CTLFireability-3
FORMULA_NAME UtahNoC-PT-none-CTLFireability-4
FORMULA_NAME UtahNoC-PT-none-CTLFireability-5
FORMULA_NAME UtahNoC-PT-none-CTLFireability-6
FORMULA_NAME UtahNoC-PT-none-CTLFireability-7
FORMULA_NAME UtahNoC-PT-none-CTLFireability-8
FORMULA_NAME UtahNoC-PT-none-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1463882259724
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ UtahNoC-PT-none
FORMULA UtahNoC-PT-none-CTLFireability-0 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-2 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-3 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-4 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-5 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-7 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-8 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-10 CANNOT_COMPUTE
FORMULA UtahNoC-PT-none-CTLFireability-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA UtahNoC-PT-none-CTLFireability-15 CANNOT_COMPUTE
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: 1193/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 216 places, 977 transitions, 208 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 979 transition conflict sets
lola: TASK
lola: reading formula from UtahNoC-PT-none-CTLFireability.task
lola: read: E(!(FIREABLE(t783)) U (AG (FIREABLE(t702)) OR AG (FIREABLE(t42)))) : AG (!(FIREABLE(t81))) : !((AX (AF (FIREABLE(t289))) OR EF (EF (FIREABLE(t762))))) : AG (EX (!((FIREABLE(t288) AND FIREABLE(t254))))) : EF (EG (FIREABLE(t297))) : (!((((FIREABLE(t746) AND (FIREABLE(t413) OR FIREABLE(t476))) OR EX (FIREABLE(t526))) OR EF ((FIREABLE(t298) OR FIREABLE(t660))))) OR EX (AF (FIREABLE(t941)))) : !((!(EF ... (shortened)
lola: formula length: 1208
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(! FIREABLE(t783) U (AG (FIREABLE(t702)) OR AG (FIREABLE(t42))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(! FIREABLE(t783) U (!(E(TRUE U !(FIREABLE(t702)))) OR !(E(TRUE U !(FIREABLE(t42))))))
lola: processed formula length: 87
lola: 107 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: 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: AG (! FIREABLE(t81))
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 28 bytes per marking, with 16 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (EG (! FIREABLE(t289))) AND AG (! FIREABLE(t762)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (! FIREABLE(t289)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(! FIREABLE(t289)))))
lola: processed formula length: 36
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX ((! FIREABLE(t288) OR ! FIREABLE(t254))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX((! FIREABLE(t288) OR ! FIREABLE(t254))))))
lola: processed formula length: 58
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (FIREABLE(t297)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(FIREABLE(t297)))))
lola: processed formula length: 40
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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 5 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((! FIREABLE(t746) OR (! FIREABLE(t413) AND ! FIREABLE(t476))) AND (AX (! FIREABLE(t526)) AND AG ((! FIREABLE(t298) AND ! FIREABLE(t660))))) OR EX (AF (FIREABLE(t941))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(t746) OR (! FIREABLE(t413) AND ! FIREABLE(t476)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (! FIREABLE(t526))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(! FIREABLE(t526))
lola: processed formula length: 20
lola: 105 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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 7 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t298) AND ! FIREABLE(t660)))
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 28 bytes per marking, with 16 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 8 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AF (FIREABLE(t941)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U FIREABLE(t941)))
lola: processed formula length: 28
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: 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 6 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((FIREABLE(t529) OR FIREABLE(t921))) AND ! FIREABLE(t20))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t529) OR FIREABLE(t921)))
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 28 bytes per marking, with 16 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 7 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ! FIREABLE(t20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(t944) OR AG (! FIREABLE(t906))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (FIREABLE(t944) OR !(E(TRUE U !(! FIREABLE(t906))))))
lola: processed formula length: 62
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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 8 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t649) OR (EF (EG (FIREABLE(t879))) AND EG ((! FIREABLE(t122) OR ! FIREABLE(t898)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t649)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (FIREABLE(t879)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(FIREABLE(t879)))))
lola: processed formula length: 40
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG ((! FIREABLE(t519) AND ! FIREABLE(t284))) OR (AG (! FIREABLE(t698)) AND ! FIREABLE(t279))) AND EF (! FIREABLE(t110)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t519) AND ! FIREABLE(t284)))
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 28 bytes per marking, with 16 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 10 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t698))
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 28 bytes per marking, with 16 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (E(FIREABLE(t365) U (FIREABLE(t403) AND FIREABLE(t829))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U E(FIREABLE(t365) U (FIREABLE(t403) AND FIREABLE(t829))))
lola: processed formula length: 65
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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 11 will run for 307 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (FIREABLE(t378)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(t378)))
lola: processed formula length: 28
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: subprocess 12 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((! FIREABLE(t260) AND EF (FIREABLE(t42)))) AND EF (FIREABLE(t327)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(t260) AND EF (FIREABLE(t42))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: !(E(TRUE U !((! FIREABLE(t260) AND E(TRUE U FIREABLE(t42))))))
lola: processed formula length: 62
lola: 106 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((! FIREABLE(t653) AND ! FIREABLE(t445)) OR (! FIREABLE(t257) OR (! FIREABLE(t662) OR ((! FIREABLE(t612) AND ! FIREABLE(t744)) OR (! FIREABLE(t452) AND ! FIREABLE(t668)))))) AND (A(! FIREABLE(t67) R ! FIREABLE(t65)) AND (AG (! FIREABLE(t332)) AND ! FIREABLE(t758))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((! FIREABLE(t653) AND ! FIREABLE(t445)) OR (! FIREABLE(t257) OR (! FIREABLE(t662) OR ((! FIREABLE(t612) AND ! FIREABLE(t744)) OR (! FIREABLE(t452) AND ! FIREABLE(t668))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: ========================================
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(! FIREABLE(t67) R ! FIREABLE(t65))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!(! FIREABLE(t67)) U !(! FIREABLE(t65))))
lola: processed formula length: 45
lola: 105 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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 15 will run for 1398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t332))
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 28 bytes per marking, with 16 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t288))
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 28 bytes per marking, with 16 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 15 will run for 1398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG (EF (FIREABLE(t123))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !(E(TRUE U FIREABLE(t123))))))
lola: processed formula length: 44
lola: 107 rewrites
lola: formula mentions 0 of 216 places; total mentions: 0
lola: closed formula file UtahNoC-PT-none-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 16 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: RESULT
lola: summary: unknown no unknown unknown unknown unknown yes unknown unknown no unknown yes no no yes unknown
BK_STOP 1463885577267
--------------------
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="UtahNoC-PT-none"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 UtahNoC-PT-none, 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 r134kn-smll-146384395500157"
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 ;