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 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 193K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800185
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526781321472

info: Time: 3600 - MCC
===========================================================================================
prep: translating IBM703-PT-none 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 IBM703-PT-none formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ IBM703-PT-none @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 546/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 262
lola: finding significant places
lola: 262 places, 284 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 261 transition conflict sets
lola: TASK
lola: reading formula from IBM703-PT-none-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= merge_s00000457_activated)
lola: LP says that atomic proposition is always false: (2 <= merge_s00000455_input_s00000290)
lola: LP says that atomic proposition is always false: (2 <= task_s00000754_input_s00000263)
lola: LP says that atomic proposition is always false: (3 <= task_s00000753_output_s00000264)
lola: LP says that atomic proposition is always false: (2 <= task_s00000727_input_s00000263)
lola: LP says that atomic proposition is always false: (2 <= task_s00000722_output_s00000264)
lola: LP says that atomic proposition is always false: (3 <= decision_s00000787_input_s00000263)
lola: LP says that atomic proposition is always false: (2 <= task_s00000750_inputCriterion_s00000257_used)
lola: LP says that atomic proposition is always false: (2 <= merge_s00000320_input_s00000263)
lola: LP says that atomic proposition is always false: (2 <= task_s00000706_input_s00000263)
lola: LP says that atomic proposition is always false: (2 <= merge_s00000453_input_s00000290)
lola: LP says that atomic proposition is always false: (3 <= task_s00000708_output_s00000264)
lola: LP says that atomic proposition is always false: (3 <= merge_s00000454_activated)
lola: LP says that atomic proposition is always false: (2 <= task_s00000761_output_s00000264)
lola: LP says that atomic proposition is always false: (3 <= task_s00000745_inputCriterion_s00000257_used)
lola: LP says that atomic proposition is always false: (2 <= task_s00000717_inputCriterion_s00000257_used)
lola: LP says that atomic proposition is always false: (2 <= task_s00000761_output_s00000264)
lola: LP says that atomic proposition is always false: (2 <= task_s00000706_input_s00000263)
lola: LP says that atomic proposition is always false: (3 <= task_s00000722_output_s00000264)
lola: LP says that atomic proposition is always false: (3 <= task_s00000740_output_s00000264)
lola: (E (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263)))) OR ()) : E ((E (X ((task_s00000760_output_s00000264 <= task_s00000755_output_s00000264))) U E (F (FALSE)))) : A (F (E (((1 <= task_s00000757_inputCriterion_s00000257_used) U FALSE)))) : A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264)))))) : NOT(A (X (A (F (FALSE))))) : (NOT(A (F (FALSE))) AND (E (F (((task_s00000763_inputCriterion_s00000257_used <= task_s00000724_input_s00000263) OR (task_s00000746_output_s00000264 <= task_s00000735_inputCriterion_s00000257_used)))) OR E (F ((task_s00000755_input_s00000263 <= 0))))) : E (G (((1 <= merge_s00000456_input_s00000290) OR (task_s00000708_output_s00000264 <= task_s00000732_input_s00000263) OR ((1 <= task_s00000710_output_s00000264) AND (task_s00000723_output_s00000264 <= task_s00000749_inputCriterion_s00000257_used)) OR (callToProcess_s00000348_inputCriterion_s00000257_used <= task_s00000748_output_s00000264)))) : E (G (E (F (())))) : ((NOT(E (G ((decision_s00000787_input_s00000263 <= task_s00000711_output_s00000264)))) OR ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))) AND (E (X (FALSE)) OR E (F (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s00000263)))))) : E ((A (X (FALSE)) U E (G ((task_s00000758_output_s00000264 <= callToProcess_s00000348_inputCriterion_s00000257_used))))) : E (F (A (G ((merge_s00000319_input_s00000263 <= decision_s00000787_input_s00000263))))) : NOT(((((callToProcess_s00000596_inputCriterion_s00000257_used + 1 <= task_s00000748_output_s00000264)) OR A (F ((1 <= task_s00000758_inputCriterion_s00000257_used)))) AND (decision_s00000764_input_s00000263 <= task_s00000736_output_s00000264))) : A (F (())) : E (F (E (G (((1 <= task_s00000712_output_s00000264) OR (merge_s00000319_activated <= fork_s00000464_input_s00000263)))))) : A (F (A (G (())))) : A (G (A (F (FALSE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:180
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:203
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-1 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: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-2 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 DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-CTLCardinality.task
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: ========================================

FORMULA IBM703-PT-none-CTLCardinality-4 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-7 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-12 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-14 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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 IBM703-PT-none-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((task_s00000744_input_s00000263 + 1 <= alpha) AND (task_s00000717_output_s00000264 + 1 <= merge_s00000319_input_s00000290))
lola: processed formula length: 124
lola: 58 rewrites
lola: closed formula file IBM703-PT-none-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 invariant from successors.
lola: 119 markings, 123 edges
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((merge_s00000319_input_s00000263 <= decision_s00000787_input_s00000263)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (decision_s00000787_input_s00000263 + 1 <= merge_s00000319_input_s00000263)
lola: processed formula length: 75
lola: 58 rewrites
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((task_s00000758_output_s00000264 <= callToProcess_s00000348_inputCriterion_s00000257_used)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((task_s00000758_output_s00000264 <= callToProcess_s00000348_inputCriterion_s00000257_used)))
lola: processed formula length: 98
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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: 96 markings, 95 edges

lola: ========================================FORMULA IBM703-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= task_s00000712_output_s00000264) OR (merge_s00000319_activated <= fork_s00000464_input_s00000263))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: ((1 <= task_s00000712_output_s00000264) OR (merge_s00000319_activated <= fork_s00000464_input_s00000263))
lola: processed formula length: 106
lola: 57 rewrites
lola: closed formula file IBM703-PT-none-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: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 96 markings, 95 edges
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263))))
lola: processed formula length: 159
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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: 96 markings, 95 edges
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= merge_s00000456_input_s00000290) OR (task_s00000708_output_s00000264 <= task_s00000732_input_s00000263) OR ((1 <= task_s00000710_output_s00000264) AND (task_s00000723_output_s00000264 <= task_s00000749_inputCriterion_s00000257_used)) OR (callToProcess_s00000348_inputCriterion_s00000257_used <= task_s00000748_output_s00000264))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= merge_s00000456_input_s00000290) OR (task_s00000708_output_s00000264 <= task_s00000732_input_s00000263) OR ((1 <= task_s00000710_output_s00000264) AND (task_s00000723_output_s00000264 <= task_s00000749_inputCriterion_s00000257_used)) OR (callToProcess_s00000348_inputCriterion_s00000257_used <= task_s00000748_output_s00000264))))
lola: processed formula length: 346
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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: 96 markings, 95 edges
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((task_s00000748_output_s00000264 <= callToProcess_s00000596_inputCriterion_s00000257_used)) AND E (G ((task_s00000758_inputCriterion_s00000257_used <= 0)))) OR (task_s00000736_output_s00000264 + 1 <= decision_s00000764_input_s00000263))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (task_s00000736_output_s00000264 + 1 <= decision_s00000764_input_s00000263)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (task_s00000736_output_s00000264 + 1 <= decision_s00000764_input_s00000263)
lola: processed formula length: 75
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((task_s00000748_output_s00000264 <= callToProcess_s00000596_inputCriterion_s00000257_used))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((task_s00000748_output_s00000264 <= callToProcess_s00000596_inputCriterion_s00000257_used))
lola: processed formula length: 92
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-CTLCardinality.task
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 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((task_s00000758_inputCriterion_s00000257_used <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((task_s00000758_inputCriterion_s00000257_used <= 0)))
lola: processed formula length: 59
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-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: 96 markings, 95 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((task_s00000763_inputCriterion_s00000257_used <= task_s00000724_input_s00000263) OR (task_s00000746_output_s00000264 <= task_s00000735_inputCriterion_s00000257_used)))) OR E (F ((task_s00000755_input_s00000263 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((task_s00000755_input_s00000263 <= 0)))
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 ((task_s00000755_input_s00000263 <= 0)))
lola: processed formula length: 45
lola: 57 rewrites
lola: closed formula file IBM703-PT-none-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263))) OR ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))) AND E (F (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))
lola: processed formula length: 150
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 2 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: 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: E (F (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s00000263))))
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 (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s00000263))))
lola: processed formula length: 167
lola: 57 rewrites
lola: closed formula file IBM703-PT-none-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: ((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s00000263))
lola: state equation: Generated DNF with 2 literals and 2 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 IBM703-PT-none-CTLCardinality-17-0.sara
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263))) OR ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))) AND E (F (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264))
lola: processed formula length: 150
lola: 56 rewrites
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 2 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: ========================================
sara: try reading problem file IBM703-PT-none-CTLCardinality-17-0.sara.
lola: ========================================
lola: ...considering subproblem: A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263)))
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: (decision_s00000787_input_s00000263 <= task_s00000711_output_s00000264)
lola: processed formula length: 71
lola: 58 rewrites
lola: closed formula file IBM703-PT-none-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: 96 markings, 95 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA IBM703-PT-none-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes yes no no yes yes yes no yes no no
lola:
preliminary result: yes no no yes yes yes yes no no yes yes yes no yes no no
lola: memory consumption: 25304 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1526781322747

--------------------
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="IBM703-PT-none"
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/IBM703-PT-none.tgz
mv IBM703-PT-none 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 IBM703-PT-none, 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 r100-smll-152658630800185"
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 ;