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 200K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 35K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HypertorusGrid-PT-d2k2p1b00, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630700136
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526752113602

info: Time: 3600 - MCC
===========================================================================================
prep: translating HypertorusGrid-PT-d2k2p1b00 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypertorusGrid-PT-d2k2p1b00 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ HypertorusGrid-PT-d2k2p1b00 @ 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: 116/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1664
lola: finding significant places
lola: 52 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 76 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d2k2p1b00-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= pi_d1_n1_2_1)
lola: LP says that atomic proposition is always false: (3 <= po_d2_n1_2_1)
lola: LP says that atomic proposition is always false: (2 <= pi_d2_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_2_1)
lola: LP says that atomic proposition is always false: (2 <= pol_d2_n1_2_2)
lola: LP says that atomic proposition is always false: (2 <= pil_d1_n1_2_1)
lola: LP says that atomic proposition is always false: (2 <= pol_d1_n1_1_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d1_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= pi_d1_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_1_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d2_n1_2_2)
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_1)
lola: LP says that atomic proposition is always false: (3 <= po_d1_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= pol_d1_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= pol_d2_n1_1_2)
lola: LP says that atomic proposition is always false: (3 <= pi_d1_n1_2_1)
lola: LP says that atomic proposition is always false: (2 <= pi_d1_n1_2_1)
lola: E (F ((E (F ((3 <= pb_d2_n2_1_1))) AND A (F ((pb_d2_n1_1_2 <= po_d2_n1_2_1)))))) : (A (G (())) OR (((pbl_1_2 + 1 <= pol_d2_n1_1_1) OR (pi_d1_n1_2_1 <= 0)) AND A (X ((pil_d2_n1_2_2 <= pil_d1_n1_1_1))))) : E (F (())) : NOT(A (G (((pb_d1_n2_2_2 <= 2))))) : E (X (E (((pil_d2_n1_1_2 <= pb_d2_n1_2_2) U FALSE)))) : E (F (((3 <= pb_d2_n2_2_2)))) : E ((E (F ((pil_d1_n1_2_2 <= pi_d2_n1_2_1))) U A (X (FALSE)))) : (NOT(((pb_d2_n2_2_2 <= po_d1_n1_2_2) OR A (G (FALSE)))) AND A (X (A (F ((1 <= pb_d2_n1_2_2)))))) : E (F (())) : A (G (TRUE)) : E (G (((1 <= pol_d1_n1_1_2) AND (pb_d1_n2_2_2 <= pol_d2_n1_1_1) AND ((1 <= pb_d2_n1_1_1)) AND ((pol_d1_n1_1_2 + 1 <= pb_d2_n2_2_2) OR (pbl_1_1 <= 1))))) : (((E (F (FALSE)) OR A (F (FALSE))) OR E (X (FALSE))) OR A (F (A (F ((3 <= pb_d2_n2_1_2)))))) : (E (F (E (X ((3 <= pb_d1_n1_1_1))))) AND (pbl_1_1 <= po_d2_n1_1_2)) : NOT(E (X (E (G ((1 <= pol_d1_n1_1_2)))))) : (((pol_d2_n1_1_2 <= po_d1_n1_1_2) AND (E (X ((pb_d2_n2_2_2 <= pb_d2_n1_2_2))) AND ((pil_d1_n1_2_2 <= pol_d1_n1_1_2) AND (pil_d2_n1_1_1 <= pil_d1_n1_2_2) AND (3 <= pbl_2_2)))) OR A (G (()))) : E (G (A (G (TRUE))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:323
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:133
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:148
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:122
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:392
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-4 FALSE 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-8 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 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: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 HypertorusGrid-PT-d2k2p1b00-CTLCardinality-15 TRUE 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 (F ((pol_d1_n1_1_2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (1 <= pol_d1_n1_1_2)
lola: processed formula length: 20
lola: 56 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 23 markings, 23 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-13 FALSE 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: ((po_d1_n1_2_2 + 1 <= pb_d2_n2_2_2) AND A (X (A (F ((1 <= pb_d2_n1_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (po_d1_n1_2_2 + 1 <= pb_d2_n2_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d1_n1_2_2 + 1 <= pb_d2_n2_2_2)
lola: processed formula length: 34
lola: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= pb_d2_n1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pb_d2_n1_2_2 <= 0)
lola: processed formula length: 19
lola: 56 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 24 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((3 <= pb_d1_n1_1_1))))) AND (pbl_1_1 <= po_d2_n1_1_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pbl_1_1 <= po_d2_n1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pbl_1_1 <= po_d2_n1_1_2)
lola: processed formula length: 25
lola: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= pb_d1_n1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= pb_d1_n1_1_1)
lola: processed formula length: 19
lola: 55 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pb_d2_n2_2_2))))
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 (((3 <= pb_d2_n2_2_2))))
lola: processed formula length: 29
lola: 55 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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: ((3 <= pb_d2_n2_2_2))
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: 10 markings, 9 edges
lola: state equation: write sara problem file to HypertorusGrid-PT-d2k2p1b00-CTLCardinality-10-0.sara
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pb_d1_n2_2_2))))
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 (((3 <= pb_d1_n2_2_2))))
lola: processed formula length: 29
lola: 55 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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: ((3 <= pb_d1_n2_2_2))
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: 10 markings, 9 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-3 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: A (F ((3 <= pb_d2_n2_1_2)))
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: (pb_d2_n2_1_2 <= 2)
lola: processed formula length: 19
lola: 56 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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: 21 markings, 21 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= pol_d1_n1_1_2) AND (pb_d1_n2_2_2 <= pol_d2_n1_1_1) AND ((1 <= pb_d2_n1_1_1)) AND ((pol_d1_n1_1_2 + 1 <= pb_d2_n2_2_2) OR (pbl_1_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= pol_d1_n1_1_2) AND (pb_d1_n2_2_2 <= pol_d2_n1_1_1) AND ((1 <= pb_d2_n1_1_1)) AND ((pol_d1_n1_1_2 + 1 <= pb_d2_n2_2_2) OR (pbl_1_1 <= 1)))))
lola: processed formula length: 153
lola: 54 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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: 25 markings, 25 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((pil_d1_n1_2_2 <= pi_d2_n1_2_1))) U DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(E(TRUE U (pil_d1_n1_2_2 <= pi_d2_n1_2_1)) U DEADLOCK)
lola: processed formula length: 55
lola: 56 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 2 significant temporal operators and needs 9 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: 189 markings, 382 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: sara: try reading problem file HypertorusGrid-PT-d2k2p1b00-CTLCardinality-10-0.sara.
...considering subproblem: E (F ((E (F ((3 <= pb_d2_n2_1_1))) AND A (F ((pb_d2_n1_1_2 <= po_d2_n1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (E(TRUE U (3 <= pb_d2_n2_1_1)) AND A(TRUE U (pb_d2_n1_1_2 <= po_d2_n1_2_1))))
lola: processed formula length: 86
lola: 57 rewrites
lola: closed formula file HypertorusGrid-PT-d2k2p1b00-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2939 markings, 7183 edges
lola:
FORMULA HypertorusGrid-PT-d2k2p1b00-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes yes no no yes yes no yes no yes yes
lola:
preliminary result: yes yes no yes no yes yes no no yes yes no yes no yes yes
========================================
lola: memory consumption: 23744 KB
lola: time consumption: 0 seconds

BK_STOP 1526752114276

--------------------
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="HypertorusGrid-PT-d2k2p1b00"
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/HypertorusGrid-PT-d2k2p1b00.tgz
mv HypertorusGrid-PT-d2k2p1b00 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 HypertorusGrid-PT-d2k2p1b00, 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-152658630700136"
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 ;