About the Execution of LoLA for DiscoveryGPU-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
215.320 | 3600000.00 | 87553.00 | 454.40 | F????F??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)
.................
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.8K May 30 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 30 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 28 09:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 09:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 28 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 06:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 06:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 03:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 03:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 89K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DiscoveryGPU-PT-12b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169500121
=====================================================================
--------------------
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 DiscoveryGPU-PT-12b-CTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1527779037934
info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-12b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DiscoveryGPU-PT-12b formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ DiscoveryGPU-PT-12b @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 352 places, 374 transitions, 338 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 438 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-12b-CTLFireability.task
lola: (((((FIREABLE(t37) AND FIREABLE(t244) AND FIREABLE(t74)) OR FIREABLE(t246)) OR A (G (NOT FIREABLE(t124)))) AND (E (F ((FIREABLE(t45) AND FIREABLE(t119)))) OR A ((FIREABLE(t3) U FIREABLE(t104))))) OR A (X ((FIREABLE(t291) OR FIREABLE(t170))))) : ((FIREABLE(t115) OR A (F (FIREABLE(t311)))) AND NOT(NOT((E (F (FIREABLE(t129))) OR (FIREABLE(t165) OR FIREABLE(t74) OR FIREABLE(t289) OR FIREABLE(t185)))))) : NOT(E (((NOT FIREABLE(t183) OR NOT FIREABLE(t75)) U (FIREABLE(t180) AND FIREABLE(t111))))) : A (F (FIREABLE(t248))) : A (G (NOT(A ((FIREABLE(t169) U FIREABLE(t361)))))) : (A (X (E (G (FIREABLE(t1))))) AND E (X (NOT(A (X (FIREABLE(t82))))))) : A ((((NOT FIREABLE(t219) AND NOT FIREABLE(t318)) OR FIREABLE(t73)) U ((FIREABLE(t315) OR FIREABLE(t14) OR (FIREABLE(t20) AND FIREABLE(t82))) AND (NOT FIREABLE(t232) OR NOT FIREABLE(t0))))) : A (G ((((FIREABLE(t181) AND FIREABLE(t100) AND FIREABLE(t146) AND FIREABLE(t135)) AND A (F (FIREABLE(t62)))) OR ((FIREABLE(t358) OR FIREABLE(t278) OR (FIREABLE(t29) AND FIREABLE(t212))) OR A (F (FIREABLE(t104))))))) : (((NOT FIREABLE(t6) AND FIREABLE(t200)) OR ((FIREABLE(t154) OR FIREABLE(t311)) OR (A (F (FIREABLE(t100))) AND ((FIREABLE(t126) OR FIREABLE(t290)) AND (FIREABLE(t64) OR FIREABLE(t3)))))) OR A (X (NOT(A (F (FIREABLE(t110))))))) : NOT(A (G ((NOT FIREABLE(t106) OR NOT FIREABLE(t100) OR FIREABLE(t20))))) : A (F ((FIREABLE(t216) OR A (X (FIREABLE(t46)))))) : ((E (X (A (X (FIREABLE(t49))))) AND NOT FIREABLE(t101)) OR NOT(((NOT FIREABLE(t364) OR (FIREABLE(t303) AND FIREABLE(t175)) OR (FIREABLE(t258) AND FIREABLE(t92) AND FIREABLE(t79))) AND E (G (NOT FIREABLE(t78)))))) : E (F (FIREABLE(t229))) : (NOT(((E (X (FIREABLE(t174))) AND FIREABLE(t95)) OR ((FIREABLE(t149) OR FIREABLE(t185) OR NOT FIREABLE(t331)) AND FIREABLE(t12)))) AND E (G (NOT(E (X (FIREABLE(t346))))))) : E (F (FIREABLE(t296))) : A (X (E ((NOT FIREABLE(t68) U FIREABLE(t105)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((((FIREABLE(t37) AND FIREABLE(t244) AND FIREABLE(t74)) OR FIREABLE(t246)) OR A (G (NOT FIREABLE(t124)))) AND (E (F ((FIREABLE(t45) AND FIREABLE(t119)))) OR A ((FIREABLE(t3) U FIREABLE(t104))))) OR A (X ((FIREABLE(t291) OR FIREABLE(t170)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t3) U FIREABLE(t104)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(t3) U FIREABLE(t104)))
lola: processed formula length: 35
lola: 49 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t37) AND FIREABLE(t244) AND FIREABLE(t74)) OR FIREABLE(t246))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t37) AND FIREABLE(t244) AND FIREABLE(t74)) OR FIREABLE(t246))
lola: processed formula length: 73
lola: 45 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t124)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (NOT FIREABLE(t124)))
lola: processed formula length: 26
lola: 47 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: FIREABLE(t124)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t291) OR FIREABLE(t170))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(t291) OR FIREABLE(t170)))
lola: processed formula length: 39
lola: 46 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DiscoveryGPU-PT-12b-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G (FIREABLE(t1))))) AND E (X (E (X (NOT FIREABLE(t82))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (FIREABLE(t1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U NOT FIREABLE(t1))))
lola: processed formula length: 35
lola: 48 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 181 markings, 317 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA DiscoveryGPU-PT-12b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t6) AND FIREABLE(t200)) OR ((FIREABLE(t154) OR FIREABLE(t311)) OR ((A (F (FIREABLE(t100))) AND ((FIREABLE(t126) OR FIREABLE(t290)) AND (FIREABLE(t64) OR FIREABLE(t3)))) OR A (X (E (G (NOT FIREABLE(t110))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t126) OR FIREABLE(t290)) AND (FIREABLE(t64) OR FIREABLE(t3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t126) OR FIREABLE(t290)) AND (FIREABLE(t64) OR FIREABLE(t3)))
lola: processed formula length: 74
lola: 45 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t154) OR FIREABLE(t311))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t154) OR FIREABLE(t311))
lola: processed formula length: 35
lola: 45 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t6) AND FIREABLE(t200))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t6) AND FIREABLE(t200))
lola: processed formula length: 37
lola: 45 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (NOT FIREABLE(t110)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: AX(NOT(A(TRUE U FIREABLE(t110))))
lola: processed formula length: 33
lola: 48 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA DiscoveryGPU-PT-12b-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t216) OR A (X (FIREABLE(t46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (FIREABLE(t216) OR AX(FIREABLE(t46))))
lola: processed formula length: 47
lola: 47 rewrites
lola: closed formula file DiscoveryGPU-PT-12b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 38 markings, 38 edges
lola: ========================================
FORMULA DiscoveryGPU-PT-12b-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (A (X (FIREABLE(t49))))) AND NOT FIREABLE(t101)) OR ((FIREABLE(t364) AND (NOT FIREABLE(t303) OR NOT FIREABLE(t175)) AND (NOT FIREABLE(t258) OR NOT FIREABLE(t92) OR NOT FIREABLE(t79))) OR A (F (FIREABLE(t78)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown no unknown unknown yes unknown no unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14972 KB
lola: time consumption: 297 seconds
lola: time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown no unknown unknown yes unknown no unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown unknown unknown unknown no unknown unknown yes unknown no unknown unknown unknown unknown unknown
lola: memory consumption: 14972 KB
lola: time consumption: 3569 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
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="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is DiscoveryGPU-PT-12b, 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 r280-csrt-152749169500121"
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 ;