fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r136-qhx2-152673579200374
Last Updated
June 26, 2018

About the Execution of LoLA for ResAllocation-PT-R003C100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
290.610 28623.00 12343.00 4283.00 FFFFTTTFFTTTTFTF 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 868K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 693K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ResAllocation-PT-R003C100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673579200374
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527010878669

info: Time: 3600 - MCC
===========================================================================================
prep: translating ResAllocation-PT-R003C100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating ResAllocation-PT-R003C100 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ResAllocation-PT-R003C100 @ 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: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 600
lola: finding significant places
lola: 600 places, 400 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C100-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p_13_2)
lola: LP says that atomic proposition is always false: (2 <= r_58_0)
lola: LP says that atomic proposition is always false: (2 <= r_87_1)
lola: LP says that atomic proposition is always false: (3 <= r_59_1)
lola: LP says that atomic proposition is always false: (3 <= p_46_1)
lola: LP says that atomic proposition is always false: (2 <= r_86_2)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p_56_1)
lola: LP says that atomic proposition is always false: (2 <= r_85_1)
lola: LP says that atomic proposition is always false: (2 <= r_57_1)
lola: LP says that atomic proposition is always false: (2 <= p_87_1)
lola: LP says that atomic proposition is always false: (3 <= p_21_2)
lola: LP says that atomic proposition is always false: (2 <= r_47_0)
lola: LP says that atomic proposition is always false: (3 <= r_74_1)
lola: LP says that atomic proposition is always false: (3 <= p_30_2)
lola: NOT(E (F (E (G ((r_37_2 <= r_94_1)))))) : (FALSE OR A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))) : A ((A (X ((p_32_1 <= r_43_0))) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0)))) : ((A (F (((1 <= r_33_1) AND (1 <= r_21_2)))) OR ((r_36_1 <= r_73_1) AND (r_56_0 <= r_9_0))) AND A (F (()))) : E (G ((((r_76_0 <= r_56_2) OR (p_74_0 <= r_71_2)) AND ((p_17_2 + 1 <= r_48_0))))) : ((((1 <= p_58_1) OR E (F ((r_40_1 <= r_49_1)))) OR ((r_45_1 + 1 <= p_59_0) OR (r_18_0 <= 0))) AND E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (p_33_2 <= r_26_2))))) : E (F (NOT(A (X ((r_18_0 <= r_72_1)))))) : A (F ((((r_14_0 <= r_30_1) AND ((r_32_0 <= p_82_1)))))) : (E (((p_9_2 <= r_12_1) U FALSE)) AND (A (F (((p_53_0 <= r_58_2) OR (1 <= r_41_0)))) OR E (((r_95_2 <= r_12_1) U (p_99_0 <= p_60_1))))) : E (G ((p_49_1 <= p_97_0))) : E ((E (X ((r_91_2 <= p_17_0))) U A (X (FALSE)))) : E (F ((A (X ((r_22_1 <= r_52_0))) OR E (G (FALSE))))) : (NOT(A (((p_75_1 <= r_39_0) U (1 <= p_62_1)))) OR FALSE) : NOT(E (G ((p_52_0 <= r_87_1)))) : E (G ((p_12_2 <= r_80_2))) : E (X (E (X (()))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:395
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:133
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: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-3 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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

FORMULA ResAllocation-PT-R003C100-CTLCardinality-8 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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

FORMULA ResAllocation-PT-R003C100-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p_32_1 <= r_43_0))) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: ========================================
lola: processed formula: A(AX((p_32_1 <= r_43_0)) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0)))
lola: processed formula length: 69
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: 4 markings, 4 edges

FORMULA ResAllocation-PT-R003C100-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((r_91_2 <= p_17_0))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(EX((r_91_2 <= p_17_0)) U DEADLOCK)
lola: processed formula length: 36
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: 143725 markings, 203532 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((r_22_1 <= r_52_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((r_22_1 <= r_52_0)))
lola: processed formula length: 32
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: 143680 markings, 203487 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((r_72_1 + 1 <= r_18_0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (r_72_1 + 1 <= r_18_0)
lola: processed formula length: 22
lola: 39 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p_49_1 <= p_97_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p_49_1 <= p_97_0)))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 57 markings, 57 edges

FORMULA ResAllocation-PT-R003C100-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((r_87_1 + 1 <= p_52_0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p_52_0 <= r_87_1)
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p_12_2 <= r_80_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p_12_2 <= r_80_2)))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((r_94_1 + 1 <= r_37_2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (r_37_2 <= r_94_1)
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 57 markings, 57 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((r_14_0 <= r_30_1) AND ((r_32_0 <= p_82_1))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((r_30_1 + 1 <= r_14_0) OR ((p_82_1 + 1 <= r_32_0))))
lola: processed formula length: 55
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 4 markings, 4 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((r_78_2 <= r_80_1) OR (r_6_0 <= p_92_1))
lola: processed formula length: 42
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 17 markings, 17 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((r_76_0 <= r_56_2) OR (p_74_0 <= r_71_2)) AND ((p_17_2 + 1 <= r_48_0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((r_76_0 <= r_56_2) OR (p_74_0 <= r_71_2)) AND ((p_17_2 + 1 <= r_48_0)))))
lola: processed formula length: 82
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((r_39_0 + 1 <= p_75_1) R (p_62_1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((r_39_0 + 1 <= p_75_1) R (p_62_1 <= 0)))
lola: processed formula length: 44
lola: 40 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 57 markings, 57 edges
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p_58_1) OR (E (F ((r_40_1 <= r_49_1))) OR ((r_45_1 + 1 <= p_59_0) OR (r_18_0 <= 0)))) AND E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (p_33_2 <= r_26_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (p_33_2 <= r_26_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (p_33_2 <= r_26_2))))
lola: processed formula length: 74
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 4 markings, 4 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p_58_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_58_1)
lola: processed formula length: 13
lola: 38 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: processed formula with 1 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 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((r_40_1 <= r_49_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((r_40_1 <= r_49_1)))
lola: processed formula length: 26
lola: 39 rewrites
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (r_40_1 <= r_49_1)
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: 0 markings, 0 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C100-CTLCardinality-18-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ResAllocation-PT-R003C100-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes yes no no yes yes yes yes no yes no
lola:
preliminary result: no no no no yes yes yes no no yes yes yes yes no yes no
lola: memory consumption: 25640 KB
lola: time consumption: 8 seconds

BK_STOP 1527010907292

--------------------
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="ResAllocation-PT-R003C100"
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

tar xzf /home/mcc/BenchKit/INPUTS/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ResAllocation-PT-R003C100, 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 r136-qhx2-152673579200374"
echo "====================================================================="
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 ;