Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234655000319.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is DiscoveryGPU-PT-09a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234655000319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.7K Feb 10 21:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 10 21:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 18:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 18:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 3 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 30 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 30 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 32K Mar 10 17:31 model.pnml

--------------------
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-09a-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-09a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552605696259

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DiscoveryGPU-PT-09a @ 3570 seconds

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DiscoveryGPU-PT-09a-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ DiscoveryGPU-PT-09a

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2842
},
"exit":
{
"localtimelimitreached": false,
"memory": 25152,
"runtime": 3570.000000,
"signal": "User defined signal 1"
},
"result":
{
"preliminary_value": "no no yes no no no unknown no yes no yes yes no yes unknown yes "
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 220/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 93
lola: finding significant places
lola: 93 places, 127 transitions, 91 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= p27)
lola: LP says that atomic proposition is always false: (2 <= p37)
lola: LP says that atomic proposition is always false: (2 <= p28)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p44)
lola: LP says that atomic proposition is always false: (2 <= p2)
lola: LP says that atomic proposition is always false: (2 <= p61)
lola: LP says that atomic proposition is always false: (3 <= p23)
lola: LP says that atomic proposition is always false: (3 <= p29)
lola: LP says that atomic proposition is always false: (2 <= p53)
lola: LP says that atomic proposition is always false: (2 <= p49)
lola: LP says that atomic proposition is always false: (2 <= p71)
lola: A (G ((p3 <= p40))) : A (G (((p85 <= p83) OR (1 <= p58)))) : NOT(A (G (A (F ((p1 <= p44)))))) : A (G (E (G (((p64 <= p74) OR (p26 <= p32)))))) : E (F (())) : ((((p51 <= p43) OR (p77 <= p57)) OR (A (G ((p2 <= p83))) AND (p20 <= p32))) AND (E (((p16 <= p85) U (2 <= p28))) AND A (((p39 <= p40) U (p62 <= p71))))) : E (F ((A (X ((3 <= p20))) AND A (G ((1 <= p23)))))) : (E ((((p2 <= p47) OR (p45 <= p63)) U ((p48 <= p58) OR (p38 <= p62)))) AND (E (F ((3 <= p44))) AND A (((p63 <= p39) U (p41 <= p30))))) : E (F (A (((2 <= p2) U (1 <= p41))))) : (A (G (((p56 <= 0) OR ((p36 <= p72) AND (p61 <= p77))))) AND (((p63 <= p38) OR E (X ((p52 <= p6)))) OR A (((1 <= p82) U (2 <= p61))))) : NOT(E (F (E (F ((3 <= p23)))))) : E (((p63 <= p8) U ((p45 + 1 <= p3) AND (p77 + 1 <= p16)))) : A (G (A (((p41 <= p70) U (p76 <= p10))))) : A (G (A (X ((p29 <= 2))))) : (A (G ((((p45 <= p75) AND (p18 <= p3)) OR (p46 <= p7)))) OR (((p30 <= p13)) AND NOT(E (F ((p61 <= p50)))))) : ((((p53 + 1 <= p52) OR (p15 + 1 <= p36)) OR E (F (((1 <= p64) AND (1 <= p6))))) OR E (F (A (X ((2 <= p71))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:458
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p56 <= 0) OR ((p36 <= p72) AND (p61 <= p77))))) AND ((p63 <= p38) OR E (X ((p52 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p63 <= p38)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p63 <= p38)
lola: processed formula length: 12
lola: 44 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p56 <= 0) OR ((p36 <= p72) AND (p61 <= p77)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p56 <= 0) OR ((p36 <= p72) AND (p61 <= p77)))))
lola: processed formula length: 56
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: formula 0: ((1 <= p56) AND ((p72 + 1 <= p36) OR (p77 + 1 <= p61)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p41)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p41)))
lola: processed formula length: 18
lola: 45 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p41)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p3 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p3 <= p40)))
lola: processed formula length: 19
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p40 + 1 <= p3)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p85 <= p83) OR (1 <= p58))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p85 <= p83) OR (1 <= p58))))
lola: processed formula length: 37
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p83 + 1 <= p85) AND (p58 <= 0))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p64 <= p74) OR (p26 <= p32))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p64 <= p74) OR (p26 <= p32))))
lola: processed formula length: 39
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: 12 markings, 11 edges
lola: formula 0: ((p74 + 1 <= p64) AND (p32 + 1 <= p26))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p44 + 1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p44 + 1 <= p1)
lola: processed formula length: 15
lola: 47 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p44 + 1 <= p1)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved from a reachable marking.
lola: 30 markings, 31 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((DEADLOCK AND A (G ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((DEADLOCK AND AG((1 <= p23))))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 350919 markings, 2570681 edges, 70184 markings/sec, 0 secs
lola: 664491 markings, 5141505 edges, 62714 markings/sec, 5 secs
lola: 979748 markings, 7628371 edges, 63051 markings/sec, 10 secs
lola: 1287696 markings, 10139816 edges, 61590 markings/sec, 15 secs
lola: 1563313 markings, 12657647 edges, 55123 markings/sec, 20 secs
lola: 1836471 markings, 15095671 edges, 54632 markings/sec, 25 secs
lola: 2118920 markings, 17494273 edges, 56490 markings/sec, 30 secs
lola: 2403488 markings, 20023455 edges, 56914 markings/sec, 35 secs
lola: 2670128 markings, 22464626 edges, 53328 markings/sec, 40 secs
lola: 2939205 markings, 24849652 edges, 53815 markings/sec, 45 secs
lola: 3213890 markings, 27315983 edges, 54937 markings/sec, 50 secs
lola: 3468303 markings, 29847641 edges, 50883 markings/sec, 55 secs
lola: 3703720 markings, 32278741 edges, 47083 markings/sec, 60 secs
lola: 3948281 markings, 34675274 edges, 48912 markings/sec, 65 secs
lola: 4232445 markings, 37060269 edges, 56833 markings/sec, 70 secs
lola: 4508094 markings, 39553556 edges, 55130 markings/sec, 75 secs
lola: 4763305 markings, 42020857 edges, 51042 markings/sec, 80 secs
lola: 5020841 markings, 44458687 edges, 51507 markings/sec, 85 secs
lola: 5268018 markings, 46844961 edges, 49435 markings/sec, 90 secs
lola: 5513122 markings, 49197688 edges, 49021 markings/sec, 95 secs
lola: 5770031 markings, 51556353 edges, 51382 markings/sec, 100 secs
lola: 6013397 markings, 53897697 edges, 48673 markings/sec, 105 secs
lola: 6272482 markings, 56284618 edges, 51817 markings/sec, 110 secs
lola: 6509328 markings, 58673197 edges, 47369 markings/sec, 115 secs
lola: 6738217 markings, 60998860 edges, 45778 markings/sec, 120 secs
lola: 6970465 markings, 63290948 edges, 46450 markings/sec, 125 secs
lola: 7248409 markings, 65598001 edges, 55589 markings/sec, 130 secs
lola: 7508341 markings, 67955529 edges, 51986 markings/sec, 135 secs
lola: 7758585 markings, 70238838 edges, 50049 markings/sec, 140 secs
lola: 8010776 markings, 72469999 edges, 50438 markings/sec, 145 secs
lola: 8291431 markings, 74793094 edges, 56131 markings/sec, 150 secs
lola: 8551363 markings, 77154543 edges, 51986 markings/sec, 155 secs
lola: 8792316 markings, 79519212 edges, 48191 markings/sec, 160 secs
lola: 9035818 markings, 81805650 edges, 48700 markings/sec, 165 secs
lola: 9275365 markings, 84125367 edges, 47909 markings/sec, 170 secs
lola: 9517209 markings, 86436915 edges, 48369 markings/sec, 175 secs
lola: 9768522 markings, 88743030 edges, 50263 markings/sec, 180 secs
lola: 10005877 markings, 91035303 edges, 47471 markings/sec, 185 secs
lola: 10288167 markings, 93344098 edges, 56458 markings/sec, 190 secs
lola: 10540134 markings, 95658577 edges, 50393 markings/sec, 195 secs
lola: 10791454 markings, 97923330 edges, 50264 markings/sec, 200 secs
lola: 11047270 markings, 100187769 edges, 51163 markings/sec, 205 secs
lola: 11311933 markings, 102659608 edges, 52933 markings/sec, 210 secs
lola: 11552178 markings, 105114050 edges, 48049 markings/sec, 215 secs
lola: 11789433 markings, 107494263 edges, 47451 markings/sec, 220 secs
lola: 12018108 markings, 109737647 edges, 45735 markings/sec, 225 secs
lola: 12278914 markings, 112145113 edges, 52161 markings/sec, 230 secs
lola: 12511938 markings, 114499687 edges, 46605 markings/sec, 235 secs
lola: 12740499 markings, 116821485 edges, 45712 markings/sec, 240 secs
lola: 12972143 markings, 119107692 edges, 46329 markings/sec, 245 secs
lola: 13211659 markings, 121506905 edges, 47903 markings/sec, 250 secs
lola: 13437771 markings, 123982578 edges, 45222 markings/sec, 255 secs
lola: 13645887 markings, 126312536 edges, 41623 markings/sec, 260 secs
lola: 13861792 markings, 128640073 edges, 43181 markings/sec, 265 secs
lola: 14086799 markings, 130952035 edges, 45001 markings/sec, 270 secs
lola: 14333857 markings, 133331380 edges, 49412 markings/sec, 275 secs
lola: 14576831 markings, 135757562 edges, 48595 markings/sec, 280 secs
lola: 14797700 markings, 138173165 edges, 44174 markings/sec, 285 secs
lola: 15027503 markings, 140548328 edges, 45961 markings/sec, 290 secs
lola: 15247807 markings, 142888426 edges, 44061 markings/sec, 295 secs
lola: 15457122 markings, 145132404 edges, 41863 markings/sec, 300 secs
lola: 15687653 markings, 147447125 edges, 46106 markings/sec, 305 secs
lola: 15902300 markings, 149759225 edges, 42929 markings/sec, 310 secs
lola: 16132675 markings, 152073601 edges, 46075 markings/sec, 315 secs
lola: 16353556 markings, 154455534 edges, 44176 markings/sec, 320 secs
lola: 16563328 markings, 156784332 edges, 41954 markings/sec, 325 secs
lola: 16770487 markings, 159087890 edges, 41432 markings/sec, 330 secs
lola: 16979052 markings, 161359660 edges, 41713 markings/sec, 335 secs
lola: 17230269 markings, 163667855 edges, 50243 markings/sec, 340 secs
lola: 17462206 markings, 165982314 edges, 46387 markings/sec, 345 secs
lola: 17682853 markings, 168263038 edges, 44129 markings/sec, 350 secs
lola: 17914568 markings, 170525522 edges, 46343 markings/sec, 355 secs
lola: 18154083 markings, 172779929 edges, 47903 markings/sec, 360 secs
lola: 18390981 markings, 175106201 edges, 47380 markings/sec, 365 secs
lola: 18624870 markings, 177441911 edges, 46778 markings/sec, 370 secs
lola: 18840546 markings, 179771853 edges, 43135 markings/sec, 375 secs
lola: 19058752 markings, 182091882 edges, 43641 markings/sec, 380 secs
lola: 19273123 markings, 184374064 edges, 42874 markings/sec, 385 secs
lola: 19487714 markings, 186647806 edges, 42918 markings/sec, 390 secs
lola: 19713375 markings, 188913444 edges, 45132 markings/sec, 395 secs
lola: 19922231 markings, 191163157 edges, 41771 markings/sec, 400 secs
lola: 20180390 markings, 193428302 edges, 51632 markings/sec, 405 secs
lola: 20439706 markings, 195724870 edges, 51863 markings/sec, 410 secs
lola: 20683182 markings, 197983350 edges, 48695 markings/sec, 415 secs
lola: 20934964 markings, 200208055 edges, 50356 markings/sec, 420 secs
lola: 21193484 markings, 202535752 edges, 51704 markings/sec, 425 secs
lola: 21436953 markings, 204936639 edges, 48694 markings/sec, 430 secs
lola: 21659844 markings, 207219814 edges, 44578 markings/sec, 435 secs
lola: 21898270 markings, 209556089 edges, 47685 markings/sec, 440 secs
lola: 22147974 markings, 211892456 edges, 49941 markings/sec, 445 secs
lola: 22393721 markings, 214331847 edges, 49149 markings/sec, 450 secs
lola: 22628343 markings, 216678026 edges, 46924 markings/sec, 455 secs
lola: 22863218 markings, 218992809 edges, 46975 markings/sec, 460 secs
lola: 23092617 markings, 221276424 edges, 45880 markings/sec, 465 secs
lola: 23325246 markings, 223721103 edges, 46526 markings/sec, 470 secs
lola: 23538442 markings, 226118628 edges, 42639 markings/sec, 475 secs
lola: 23743978 markings, 228396923 edges, 41107 markings/sec, 480 secs
lola: 23957722 markings, 230726222 edges, 42749 markings/sec, 485 secs
lola: 24205417 markings, 233043103 edges, 49539 markings/sec, 490 secs
lola: 24446804 markings, 235430000 edges, 48277 markings/sec, 495 secs
lola: 24675808 markings, 237805647 edges, 45801 markings/sec, 500 secs
lola: 24895117 markings, 240124186 edges, 43862 markings/sec, 505 secs
lola: 25110006 markings, 242440146 edges, 42978 markings/sec, 510 secs
lola: 25317352 markings, 244673036 edges, 41469 markings/sec, 515 secs
lola: 25536714 markings, 246961188 edges, 43872 markings/sec, 520 secs
lola: 25762484 markings, 249253405 edges, 45154 markings/sec, 525 secs
lola: 25974344 markings, 251522774 edges, 42372 markings/sec, 530 secs
lola: 26201150 markings, 253808779 edges, 45361 markings/sec, 535 secs
lola: 26413775 markings, 256132738 edges, 42525 markings/sec, 540 secs
lola: 26619759 markings, 258410722 edges, 41197 markings/sec, 545 secs
lola: 26826698 markings, 260661507 edges, 41388 markings/sec, 550 secs
lola: 27035285 markings, 262883133 edges, 41717 markings/sec, 555 secs
lola: 27282933 markings, 265180928 edges, 49530 markings/sec, 560 secs
lola: 27510481 markings, 267485071 edges, 45510 markings/sec, 565 secs
lola: 27731569 markings, 269730053 edges, 44218 markings/sec, 570 secs
lola: 27956268 markings, 271954399 edges, 44940 markings/sec, 575 secs
lola: 28199238 markings, 274192045 edges, 48594 markings/sec, 580 secs
lola: 28433792 markings, 276506899 edges, 46911 markings/sec, 585 secs
lola: 28660773 markings, 278829299 edges, 45396 markings/sec, 590 secs
lola: 28872238 markings, 281094447 edges, 42293 markings/sec, 595 secs
lola: 29084159 markings, 283372570 edges, 42384 markings/sec, 600 secs
lola: 29296077 markings, 285630734 edges, 42384 markings/sec, 605 secs
lola: 29508909 markings, 287869116 edges, 42566 markings/sec, 610 secs
lola: 29731801 markings, 290108201 edges, 44578 markings/sec, 615 secs
lola: 29939071 markings, 292332862 edges, 41454 markings/sec, 620 secs
lola: 30180228 markings, 294607338 edges, 48231 markings/sec, 625 secs
lola: 30414359 markings, 296923954 edges, 46826 markings/sec, 630 secs
lola: 30639767 markings, 299204779 edges, 45082 markings/sec, 635 secs
lola: 30864140 markings, 301402444 edges, 44875 markings/sec, 640 secs
lola: 31092632 markings, 303676569 edges, 45698 markings/sec, 645 secs
lola: 31327120 markings, 306143037 edges, 46898 markings/sec, 650 secs
lola: 31541598 markings, 308552595 edges, 42896 markings/sec, 655 secs
lola: 31755855 markings, 310926412 edges, 42851 markings/sec, 660 secs
lola: 31969505 markings, 313250533 edges, 42730 markings/sec, 665 secs
lola: 32205291 markings, 315647172 edges, 47157 markings/sec, 670 secs
lola: 32430172 markings, 318099945 edges, 44976 markings/sec, 675 secs
lola: 32643708 markings, 320487619 edges, 42707 markings/sec, 680 secs
lola: 32861403 markings, 322836142 edges, 43539 markings/sec, 685 secs
lola: 33074602 markings, 325179066 edges, 42640 markings/sec, 690 secs
lola: 33287595 markings, 327601577 edges, 42599 markings/sec, 695 secs
lola: 33486627 markings, 330010031 edges, 39806 markings/sec, 700 secs
lola: 33677792 markings, 332368238 edges, 38233 markings/sec, 705 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no yes no no no unknown no yes no yes unknown unknown yes unknown unknown
lola: memory consumption: 2675020 KB
lola: time consumption: 719 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p63 <= p8) U ((p45 + 1 <= p3) AND (p77 + 1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p63 <= p8) U ((p45 + 1 <= p3) AND (p77 + 1 <= p16))))
lola: processed formula length: 58
lola: 47 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p45 + 1 <= p3) AND (p77 + 1 <= p16))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-12-0.sara.
sara: error: :818: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 342145 markings, 2475640 edges, 68429 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 553035 markings, 4135743 edges
lola: ========================================
lola: subprocess 13 will run for 947 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((p41 <= p70) U (p76 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p41 <= p70) U (p76 <= p10)))
lola: processed formula length: 33
lola: 46 rewrites
lola: closed formula file CTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 404 markings, 1088 edges
lola: ========================================
lola: subprocess 14 will run for 1421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p53 + 1 <= p52) OR (p15 + 1 <= p36)) OR (E (F (((1 <= p64) AND (1 <= p6)))) OR E (F (DEADLOCK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 67 markings, 71 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p45 <= p75) AND (p18 <= p3)) OR (p46 <= p7)))) OR (((p30 <= p13)) AND A (G ((p50 + 1 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: no no yes no no no unknown no yes no yes yes no yes unknown yes
lola:
preliminary result: no no yes no no no unknown no yes no yes yes no yes unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no no yes no no no unknown no yes no yes yes no yes unknown yes
lola: memory consumption: 25152 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: memory consumption: 25152 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: caught signal User defined signal 1 - aborting LoLA
rslt: finished

BK_STOP 1552609266429

--------------------
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-09a"
export BK_EXAMINATION="CTLCardinality"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is DiscoveryGPU-PT-09a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-ebro-155234655000319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;