About the Execution of LoLA for TriangularGrid-PT-3011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
149.120 | 583.00 | 100.00 | 2.50 | FFF?FFTFFFFFF?FT | 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 236K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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.0K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K 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 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TriangularGrid-PT-3011, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743300383
=====================================================================
--------------------
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 TriangularGrid-PT-3011-ReachabilityCardinality-00
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-01
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-02
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-03
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-04
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-05
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-06
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-07
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-08
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-09
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-10
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-11
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-12
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-13
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-14
FORMULA_NAME TriangularGrid-PT-3011-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527380691980
info: Time: 3600 - MCC
===========================================================================================
prep: translating TriangularGrid-PT-3011 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TriangularGrid-PT-3011 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ TriangularGrid-PT-3011 @ 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: 198/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3456
lola: finding significant places
lola: 108 places, 90 transitions, 62 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 135 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-3011-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= pi1_2_3)
lola: LP says that atomic proposition is always false: (3 <= po2_3_5)
lola: LP says that atomic proposition is always false: (2 <= po1_3_1)
lola: LP says that atomic proposition is always false: (2 <= pil3_2_1)
lola: LP says that atomic proposition is always false: (2 <= pil2_3_3)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= pil2_3_3)
lola: LP says that atomic proposition is always false: (3 <= po3_2_1)
lola: LP says that atomic proposition is always false: (3 <= pi1_2_3)
lola: LP says that atomic proposition is always false: (2 <= po1_3_5)
lola: LP says that atomic proposition is always false: (2 <= po2_3_5)
lola: LP says that atomic proposition is always false: (3 <= po2_2_1)
lola: LP says that atomic proposition is always false: (3 <= po1_2_1)
lola: LP says that atomic proposition is always false: (3 <= pil3_3_1)
lola: LP says that atomic proposition is always false: (2 <= pol2_3_1)
lola: A (G ((((1 <= pb3_3_4) OR (2 <= pb3_1_1) OR (pil3_1_1 <= pil3_3_5))))) : A (G (((pil1_3_5 + 1 <= pol2_3_5) OR (pb1_2_3 <= 2) OR (1 <= pb3_2_1)))) : E (F (FALSE)) : E (F (())) : A (G (((pi3_3_5 <= pb2_3_3) OR (pb3_3_2 <= pil1_3_1)))) : A (G (((pb3_3_1 <= pol1_2_3) OR (pi3_3_1 <= pb3_2_2) OR (pil2_2_1 <= pil1_1_1) OR (((po3_2_3 <= po3_2_1) OR (1 <= pil3_1_1)) AND ((3 <= pbl_3_4) OR (pb2_3_4 <= po3_3_1)))))) : A (G (())) : E (F (())) : E (F (())) : E (F (())) : A (G (((pbl_3_2 <= po2_3_1) OR (pi3_3_1 <= pbl_3_5)))) : E (F (FALSE)) : E (F (())) : E (F (FALSE)) : E (F (())) : E (F ((((pil1_2_3 <= 0) AND (pil3_1_1 + 1 <= po2_3_3)))))
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: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:148
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:148
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:148
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: 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: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-2 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: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-3 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-6 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: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-7 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-8 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: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-11 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-13 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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 TriangularGrid-PT-3011-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pil1_2_3 <= 0) AND (pil3_1_1 + 1 <= po2_3_3)))))
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 ((((pil1_2_3 <= 0) AND (pil3_1_1 + 1 <= po2_3_3)))))
lola: processed formula length: 57
lola: 31 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((pil1_2_3 <= 0) AND (pil3_1_1 + 1 <= po2_3_3)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to TriangularGrid-PT-3011-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-15 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: A (G (((pi3_3_5 <= pb2_3_3) OR (pb3_3_2 <= pil1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pi3_3_5 <= pb2_3_3) OR (pb3_3_2 <= pil1_3_1))))
lola: processed formula length: 56
lola: 32 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola:
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
formula 0: ((pb2_3_3 + 1 <= pi3_3_5) AND (pil1_3_1 + 1 <= pb3_3_2))
lola: lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= pb3_3_4) OR (2 <= pb3_1_1) OR (pil3_1_1 <= pil3_3_5)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((1 <= pb3_3_4) OR (2 <= pb3_1_1) OR (pil3_1_1 <= pil3_3_5)))))
lola: processed formula length: 72
lola: 32 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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:631
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-0 FALSE 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: A (G (((pbl_3_2 <= po2_3_1) OR (pi3_3_1 <= pbl_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pbl_3_2 <= po2_3_1) OR (pi3_3_1 <= pbl_3_5))))
lola: processed formula length: 55
lola: 32 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.task
sara: try reading problem file TriangularGrid-PT-3011-ReachabilityCardinality-10-0.sara.
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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((po2_3_1 + 1 <= pbl_3_2) AND (pbl_3_5 + 1 <= pi3_3_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-3011-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TriangularGrid-PT-3011-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-10 FALSE 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: A (G (((pil1_3_5 + 1 <= pol2_3_5) OR (pb1_2_3 <= 2) OR (1 <= pb3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pil1_3_5 + 1 <= pol2_3_5) OR (pb1_2_3 <= 2) OR (1 <= pb3_2_1))))
lola: processed formula length: 74
lola: 32 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((pol2_3_5 <= pil1_3_5) AND (3 <= pb1_2_3) AND (pb3_2_1 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TriangularGrid-PT-3011-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: lola: state equation: calling and running sara
result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-1 FALSE 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 (G (((pb3_3_1 <= pol1_2_3) OR (pi3_3_1 <= pb3_2_2) OR (pil2_2_1 <= pil1_1_1) OR (((po3_2_3 <= po3_2_1) OR (1 <= pil3_1_1)) AND ((3 <= pbl_3_4) OR (pb2_3_4 <= po3_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pb3_3_1 <= pol1_2_3) OR (pi3_3_1 <= pb3_2_2) OR (pil2_2_1 <= pil1_1_1) OR (((po3_2_3 <= po3_2_1) OR (1 <= pil3_1_1)) AND ((3 <= pbl_3_4) OR (pb2_3_4 <= po3_3_1))))))
lola: processed formula length: 178
lola: 32 rewrites
lola: closed formula file TriangularGrid-PT-3011-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: sara: try reading problem file TriangularGrid-PT-3011-ReachabilityCardinality-14-0.sara.
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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola:
FORMULA TriangularGrid-PT-3011-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
formula 0: ((pol1_2_3 + 1 <= pb3_3_1) AND (pb3_2_2 + 1 <= pi3_3_1) AND (pil1_1_1 + 1 <= pil2_2_1) AND (((po3_2_1 + 1 <= po3_2_3) AND (pil3_1_1 <= 0)) OR ((pbl_3_4 <= 2) AND (po3_3_1 + 1 <= pb2_3_4))))lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no no no no no yes
lola:
preliminary result: no no no no no no yes no no no no no no no no yes
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24472 KB
lola: time consumption: 0 seconds
BK_STOP 1527380692563
--------------------
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="TriangularGrid-PT-3011"
export BK_EXAMINATION="ReachabilityCardinality"
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/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 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 TriangularGrid-PT-3011, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r172-smll-152708743300383"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;