About the Execution of LoLA for FMS-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15917.330 | 3600000.00 | 634375.00 | 5358.20 | TTFFFFFTTT?TFF?T | 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 180K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 17K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FMS-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998000087
=====================================================================
--------------------
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 FMS-PT-200-CTLCardinality-00
FORMULA_NAME FMS-PT-200-CTLCardinality-01
FORMULA_NAME FMS-PT-200-CTLCardinality-02
FORMULA_NAME FMS-PT-200-CTLCardinality-03
FORMULA_NAME FMS-PT-200-CTLCardinality-04
FORMULA_NAME FMS-PT-200-CTLCardinality-05
FORMULA_NAME FMS-PT-200-CTLCardinality-06
FORMULA_NAME FMS-PT-200-CTLCardinality-07
FORMULA_NAME FMS-PT-200-CTLCardinality-08
FORMULA_NAME FMS-PT-200-CTLCardinality-09
FORMULA_NAME FMS-PT-200-CTLCardinality-10
FORMULA_NAME FMS-PT-200-CTLCardinality-11
FORMULA_NAME FMS-PT-200-CTLCardinality-12
FORMULA_NAME FMS-PT-200-CTLCardinality-13
FORMULA_NAME FMS-PT-200-CTLCardinality-14
FORMULA_NAME FMS-PT-200-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526624451012
info: Time: 3600 - MCC
===========================================================================================
prep: translating FMS-PT-200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FMS-PT-200 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ FMS-PT-200 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-200-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always false: (2 <= M2)
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: LP says that atomic proposition is always false: (3 <= M2)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= P12M3)
lola: always true
lola: (A (X (A (G (TRUE)))) OR (A (G ((P2 <= P1))) AND A (G (((3 <= P1wP2) AND (M1 <= P2wP1)))))) : E (F (((2 <= P3M2) AND (2 <= P2s)))) : (NOT(E (F ((3 <= P1s)))) OR NOT(E (G ((M3 <= P3))))) : E (F ((E (X (FALSE)) AND ((3 <= P1s))))) : (E ((((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d)))) AND NOT(E (F ((M3 <= 0))))) : E (F ((E (G (FALSE)) AND (3 <= P2wP1)))) : (E (G (E (F ((M2 <= P3M2))))) AND A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1))))) : E ((((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12))) : A (((P3 <= P2wP1) U E (F ((P3 <= P1wP2))))) : E (X (E (F (((3 <= P2s) AND (M1 <= P2wP1)))))) : A ((((P2 <= 2) AND (P2wP1 + 1 <= P12s)) U E (F ((3 <= P1wP2))))) : (E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1))))) OR A (X (((3 <= P3) AND (2 <= M3) AND (P2s <= P2d) AND (3 <= P1M1))))) : A (G (((3 <= P2d) OR (3 <= P3M2) OR ((P1wP2 <= M3)) OR (P12 <= P2wM2) OR (P3 + 1 <= M3)))) : (((1 <= P2wP1) OR A (G (((1 <= P1) OR (2 <= M1))))) OR FALSE) : E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2)))) : (((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3)) AND A (G (A (F (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:136
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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: 36 rewrites
lola: closed formula file FMS-PT-200-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 FMS-PT-200-CTLCardinality-0 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: 36 rewrites
lola: closed formula file FMS-PT-200-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 FMS-PT-200-CTLCardinality-3 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: 36 rewrites
lola: closed formula file FMS-PT-200-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 FMS-PT-200-CTLCardinality-5 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: ((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P12s <= P1d) OR (1 <= P3) OR (P2wP1 <= P3))
lola: processed formula length: 47
lola: 36 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: processed formula with 3 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 FMS-PT-200-CTLCardinality-15 TRUE 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: (E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1))))) OR A (X (((3 <= P3) AND (2 <= M3) AND (P2s <= P2d) AND (3 <= P1M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= P12s) AND (P1wP2 <= P2wP1)))))
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 ((((1 <= P12s) AND (P1wP2 <= P2wP1)))))
lola: processed formula length: 44
lola: 37 rewrites
lola: closed formula file FMS-PT-200-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: (((1 <= P12s) AND (P1wP2 <= P2wP1)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-4-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((3 <= P2s) AND (M1 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: ((3 <= P2s) AND (M1 <= P2wP1))
lola: processed formula length: 30
lola: 37 rewrites
lola: closed formula file FMS-PT-200-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: 19 markings, 18 edges
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-9 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: E (F ((3 <= P1wP2)))
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 <= P1wP2)))
lola: processed formula length: 20
lola: 37 rewrites
lola: closed formula file FMS-PT-200-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 <= P1wP2)
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: 13 markings, 12 edges
lola: FORMULA FMS-PT-200-CTLCardinality-10 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: E (F (((2 <= P3M2) AND (2 <= P2s))))
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 (((2 <= P3M2) AND (2 <= P2s))))
lola: processed formula length: 36
lola: 37 rewrites
lola: closed formula file FMS-PT-200-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: ((2 <= P3M2) AND (2 <= P2s))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-1 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 ((P3 <= P1wP2)))
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 ((P3 <= P1wP2)))
lola: processed formula length: 21
lola: 37 rewrites
lola: closed formula file FMS-PT-200-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: (P3 <= P1wP2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 201 markings, 200 edges
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-8 TRUE 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: A (G (((3 <= P2d) OR (3 <= P3M2) OR ((P1wP2 <= M3)) OR (P12 <= P2wM2) OR (P3 + 1 <= M3))))
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 (((3 <= P2d) OR (3 <= P3M2) OR ((P1wP2 <= M3)) OR (P12 <= P2wM2) OR (P3 + 1 <= M3))))
lola: processed formula length: 94
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((P2d <= 2) AND (P3M2 <= 2) AND ((M3 + 1 <= P1wP2)) AND (P2wM2 + 1 <= P12) AND (M3 <= P3))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11781 markings, 13518 edges
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-12 FALSE 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: ((1 <= P2wP1) OR A (G (((1 <= P1) OR (2 <= M1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P2wP1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P2wP1)
lola: processed formula length: 12
lola: 36 rewrites
lola: closed formula file FMS-PT-200-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 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= P1) OR (2 <= M1))))
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 <= P1) OR (2 <= M1))))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((P1 <= 0) AND (M1 <= 1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 203 markings, 202 edges
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((P1 <= 2) OR ((3 <= P3) AND (2 <= P2))) U (2 <= P12)))
lola: processed formula length: 60
lola: 39 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (2 <= P12)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file FMS-PT-200-CTLCardinality-11-0.sara.
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-11-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 5225961 markings, 9061435 edges, 1045192 markings/sec, 0 secs
lola: sara is running 5 secs || 10129812 markings, 17546299 edges, 980770 markings/sec, 5 secs
lola: sara is running 10 secs || 14892262 markings, 25790957 edges, 952490 markings/sec, 10 secs
lola: sara is running 15 secs || 19570712 markings, 33881315 edges, 935690 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 23400535 markings, 40941304 edges
FORMULA FMS-PT-200-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((P1s <= 2))) OR A (F ((P3 + 1 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P1s <= 2)))
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:695
lola: processed formula: A (G ((P1s <= 2)))
lola: processed formula length: 18
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (3 <= P1s)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-12-0.sara.
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P3 + 1 <= M3)))
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: (M3 <= P3)
lola: processed formula length: 10
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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: 804 markings, 804 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))))
lola: processed formula length: 73
lola: 39 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-13-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 5539516 markings, 9642983 edges, 1107903 markings/sec, 0 secs
lola: sara is running 5 secs || 10539254 markings, 18296510 edges, 999948 markings/sec, 5 secs
lola: sara is running 10 secs || 15400161 markings, 26706260 edges, 972181 markings/sec, 10 secs
lola: sara is running 15 secs || 20160714 markings, 34946241 edges, 952111 markings/sec, 15 secs
lola: sara is running 20 secs || 24819354 markings, 44968117 edges, 931728 markings/sec, 20 secs
lola: sara is running 25 secs || 29442546 markings, 54912673 edges, 924638 markings/sec, 25 secs
lola: sara is running 30 secs || 32986790 markings, 63949368 edges, 708849 markings/sec, 30 secs
lola: sara is running 35 secs || 36398020 markings, 72649704 edges, 682246 markings/sec, 35 secs
lola: sara is running 40 secs || 40271226 markings, 81609738 edges, 774641 markings/sec, 40 secs
lola: sara is running 45 secs || 43361950 markings, 89735342 edges, 618145 markings/sec, 45 secs
lola: sara is running 50 secs || 46352298 markings, 97738160 edges, 598070 markings/sec, 50 secs
lola: sara is running 55 secs || 49434609 markings, 105818508 edges, 616462 markings/sec, 55 secs
lola: sara is running 60 secs || 52546537 markings, 113987144 edges, 622386 markings/sec, 60 secs
lola: sara is running 65 secs || 56236253 markings, 122426919 edges, 737943 markings/sec, 65 secs
lola: sara is running 70 secs || 59085979 markings, 130114859 edges, 569945 markings/sec, 70 secs
lola: sara is running 75 secs || 62097852 markings, 138006581 edges, 602375 markings/sec, 75 secs
lola: sara is running 80 secs || 65023179 markings, 145703474 edges, 585065 markings/sec, 80 secs
lola: sara is running 85 secs || 67829760 markings, 153215362 edges, 561316 markings/sec, 85 secs
lola: sara is running 90 secs || 70606354 markings, 160773751 edges, 555319 markings/sec, 90 secs
lola: sara is running 95 secs || 74350533 markings, 169226635 edges, 748836 markings/sec, 95 secs
lola: sara is running 100 secs || 77091037 markings, 176680936 edges, 548101 markings/sec, 100 secs
lola: sara is running 105 secs || 79874318 markings, 184185967 edges, 556656 markings/sec, 105 secs
lola: sara is running 110 secs || 82688375 markings, 191729732 edges, 562811 markings/sec, 110 secs
lola: sara is running 115 secs || 85494759 markings, 199201808 edges, 561277 markings/sec, 115 secs
lola: sara is running 120 secs || 88321064 markings, 206833482 edges, 565261 markings/sec, 120 secs
lola: sara is running 125 secs || 90943602 markings, 214077740 edges, 524508 markings/sec, 125 secs
lola: sara is running 130 secs || 93769821 markings, 221611964 edges, 565244 markings/sec, 130 secs
lola: sara is running 135 secs || 96436720 markings, 228967796 edges, 533380 markings/sec, 135 secs
lola: sara is running 140 secs || 99116121 markings, 236202503 edges, 535880 markings/sec, 140 secs
lola: sara is running 145 secs || 101762371 markings, 243446152 edges, 529250 markings/sec, 145 secs
lola: sara is running 150 secs || 104382067 markings, 250630274 edges, 523939 markings/sec, 150 secs
lola: sara is running 155 secs || 107113212 markings, 258147144 edges, 546229 markings/sec, 155 secs
lola: sara is running 160 secs || 109754485 markings, 265342442 edges, 528255 markings/sec, 160 secs
lola: sara is running 165 secs || 112346599 markings, 272414417 edges, 518423 markings/sec, 165 secs
lola: sara is running 170 secs || 115015312 markings, 279664664 edges, 533743 markings/sec, 170 secs
lola: sara is running 175 secs || 117697908 markings, 286970929 edges, 536519 markings/sec, 175 secs
lola: sara is running 180 secs || 120305882 markings, 294029746 edges, 521595 markings/sec, 180 secs
lola: sara is running 185 secs || 122846105 markings, 301079221 edges, 508045 markings/sec, 185 secs
lola: sara is running 190 secs || 125507567 markings, 308254321 edges, 532292 markings/sec, 190 secs
lola: sara is running 195 secs || 128102572 markings, 315355446 edges, 519001 markings/sec, 195 secs
lola: sara is running 200 secs || 130678033 markings, 322430791 edges, 515092 markings/sec, 200 secs
lola: sara is running 205 secs || 133257680 markings, 329451320 edges, 515929 markings/sec, 205 secs
lola: sara is running 210 secs || 135920877 markings, 336572535 edges, 532639 markings/sec, 210 secs
lola: sara is running 215 secs || 138506325 markings, 343613369 edges, 517090 markings/sec, 215 secs
lola: sara is running 220 secs || 140973497 markings, 350506890 edges, 493434 markings/sec, 220 secs
lola: sara is running 225 secs || 143455892 markings, 357401003 edges, 496479 markings/sec, 225 secs
lola: sara is running 230 secs || 145967772 markings, 364359109 edges, 502376 markings/sec, 230 secs
lola: sara is running 235 secs || 148530904 markings, 371265145 edges, 512626 markings/sec, 235 secs
lola: sara is running 240 secs || 151106891 markings, 378300280 edges, 515197 markings/sec, 240 secs
lola: sara is running 245 secs || 153509185 markings, 385027222 edges, 480459 markings/sec, 245 secs
lola: sara is running 250 secs || 155944303 markings, 391869138 edges, 487024 markings/sec, 250 secs
lola: sara is running 255 secs || 158396757 markings, 398652997 edges, 490491 markings/sec, 255 secs
lola: sara is running 260 secs || 160784436 markings, 405464078 edges, 477536 markings/sec, 260 secs
lola: sara is running 265 secs || 163358456 markings, 412506204 edges, 514804 markings/sec, 265 secs
lola: sara is running 270 secs || 165794444 markings, 419261644 edges, 487198 markings/sec, 270 secs
lola: sara is running 275 secs || 168272542 markings, 426073303 edges, 495620 markings/sec, 275 secs
lola: sara is running 280 secs || 169714944 markings, 430047805 edges, 288480 markings/sec, 280 secs
lola: sara is running 285 secs || 169755351 markings, 430156700 edges, 8081 markings/sec, 285 secs
lola: sara is running 290 secs || 169778898 markings, 430217015 edges, 4709 markings/sec, 290 secs
lola: sara is running 295 secs || 169784525 markings, 430235167 edges, 1125 markings/sec, 295 secs
lola: sara is running 300 secs || 169789123 markings, 430250288 edges, 920 markings/sec, 300 secs
lola: sara is running 305 secs || 169804992 markings, 430297979 edges, 3174 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((M1 <= P2wM2) OR (1 <= P12wM3)) U ((P12wM3 <= P1M1) OR (1 <= P2d)))) AND A (G ((1 <= M3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= M3)))
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:695
lola: processed formula: A (G ((1 <= M3)))
lola: processed formula length: 17
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (M3 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((M2 <= P3M2))))) AND A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((M2 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (M2 <= P3M2)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 1203 markings, 1203 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((P12wM3 <= P1wM1) U ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))))
lola: processed formula length: 73
lola: 39 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((3 <= P1s) AND (3 <= P1d) AND (P2d + 1 <= M2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FMS-PT-200-CTLCardinality-16-0.sara.
lola: state equation 0: solution produced
lola: sara is running 0 secs || 5456510 markings, 9498224 edges, 1091302 markings/sec, 0 secs
lola: sara is running 5 secs || 10434360 markings, 18112647 edges, 995570 markings/sec, 5 secs
lola: sara is running 10 secs || 15273782 markings, 26488508 edges, 967884 markings/sec, 10 secs
lola: sara is running 15 secs || 20018907 markings, 34697306 edges, 949025 markings/sec, 15 secs
lola: sara is running 20 secs || 24691052 markings, 44656288 edges, 934429 markings/sec, 20 secs
lola: sara is running 25 secs || 29318382 markings, 54606632 edges, 925466 markings/sec, 25 secs
lola: sara is running 30 secs || 32891382 markings, 63710108 edges, 714600 markings/sec, 30 secs
lola: sara is running 35 secs || 36324315 markings, 72467884 edges, 686587 markings/sec, 35 secs
lola: sara is running 40 secs || 40190574 markings, 81419543 edges, 773252 markings/sec, 40 secs
lola: sara is running 45 secs || 43364164 markings, 89740841 edges, 634718 markings/sec, 45 secs
lola: sara is running 50 secs || 46368820 markings, 97784120 edges, 600931 markings/sec, 50 secs
lola: sara is running 55 secs || 49474722 markings, 105915663 edges, 621180 markings/sec, 55 secs
lola: sara is running 60 secs || 52601161 markings, 114122448 edges, 625288 markings/sec, 60 secs
lola: sara is running 65 secs || 56305929 markings, 122606101 edges, 740954 markings/sec, 65 secs
lola: sara is running 70 secs || 59158146 markings, 130305520 edges, 570443 markings/sec, 70 secs
lola: sara is running 75 secs || 62168681 markings, 138193472 edges, 602107 markings/sec, 75 secs
lola: sara is running 80 secs || 65137190 markings, 146020415 edges, 593702 markings/sec, 80 secs
lola: sara is running 85 secs || 67918892 markings, 153466483 edges, 556340 markings/sec, 85 secs
lola: sara is running 90 secs || 70707996 markings, 161058463 edges, 557821 markings/sec, 90 secs
lola: sara is running 95 secs || 74465430 markings, 169533502 edges, 751487 markings/sec, 95 secs
lola: sara is running 100 secs || 77215332 markings, 177014592 edges, 549980 markings/sec, 100 secs
lola: sara is running 105 secs || 79992915 markings, 184531265 edges, 555517 markings/sec, 105 secs
lola: sara is running 110 secs || 82870647 markings, 192180272 edges, 575546 markings/sec, 110 secs
lola: sara is running 115 secs || 85652507 markings, 199626597 edges, 556372 markings/sec, 115 secs
lola: sara is running 120 secs || 88470245 markings, 207252137 edges, 563548 markings/sec, 120 secs
lola: sara is running 125 secs || 91107259 markings, 214506653 edges, 527403 markings/sec, 125 secs
lola: sara is running 130 secs || 93925124 markings, 222047846 edges, 563573 markings/sec, 130 secs
lola: sara is running 135 secs || 96597882 markings, 229397143 edges, 534552 markings/sec, 135 secs
lola: sara is running 140 secs || 99275170 markings, 236627492 edges, 535458 markings/sec, 140 secs
lola: sara is running 145 secs || 101910192 markings, 243889979 edges, 527004 markings/sec, 145 secs
lola: sara is running 150 secs || 104524936 markings, 251053392 edges, 522949 markings/sec, 150 secs
lola: sara is running 155 secs || 107294511 markings, 258618636 edges, 553915 markings/sec, 155 secs
lola: sara is running 160 secs || 109923501 markings, 265810059 edges, 525798 markings/sec, 160 secs
lola: sara is running 165 secs || 112557395 markings, 272942182 edges, 526779 markings/sec, 165 secs
lola: sara is running 170 secs || 115173803 markings, 280126877 edges, 523282 markings/sec, 170 secs
lola: sara is running 175 secs || 117866631 markings, 287459513 edges, 538566 markings/sec, 175 secs
lola: sara is running 180 secs || 120491426 markings, 294542477 edges, 524959 markings/sec, 180 secs
lola: sara is running 185 secs || 123052733 markings, 301641899 edges, 512261 markings/sec, 185 secs
lola: sara is running 190 secs || 125719409 markings, 308859753 edges, 533335 markings/sec, 190 secs
lola: sara is running 195 secs || 128271815 markings, 315815196 edges, 510481 markings/sec, 195 secs
lola: sara is running 200 secs || 130769159 markings, 322675565 edges, 499469 markings/sec, 200 secs
lola: sara is running 205 secs || 133265427 markings, 329471862 edges, 499254 markings/sec, 205 secs
lola: sara is running 210 secs || 135904305 markings, 336535688 edges, 527776 markings/sec, 210 secs
lola: sara is running 215 secs || 138506443 markings, 343613749 edges, 520428 markings/sec, 215 secs
lola: sara is running 220 secs || 140963160 markings, 350479140 edges, 491343 markings/sec, 220 secs
lola: sara is running 225 secs || 143446973 markings, 357372517 edges, 496763 markings/sec, 225 secs
lola: sara is running 230 secs || 145949519 markings, 364302982 edges, 500509 markings/sec, 230 secs
lola: sara is running 235 secs || 148505493 markings, 371192574 edges, 511195 markings/sec, 235 secs
lola: sara is running 240 secs || 151079536 markings, 378216510 edges, 514809 markings/sec, 240 secs
lola: sara is running 245 secs || 153487455 markings, 384972638 edges, 481584 markings/sec, 245 secs
lola: sara is running 250 secs || 155927398 markings, 391814687 edges, 487989 markings/sec, 250 secs
lola: sara is running 255 secs || 158392704 markings, 398639340 edges, 493061 markings/sec, 255 secs
lola: sara is running 260 secs || 160793564 markings, 405485467 edges, 480172 markings/sec, 260 secs
lola: sara is running 265 secs || 163373944 markings, 412547803 edges, 516076 markings/sec, 265 secs
lola: sara is running 270 secs || 165823130 markings, 419340930 edges, 489837 markings/sec, 270 secs
lola: sara is running 275 secs || 168305603 markings, 426163656 edges, 496495 markings/sec, 275 secs
lola: sara is running 280 secs || 169730287 markings, 430092051 edges, 284937 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
FORMULA FMS-PT-200-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((M2 <= P3M2))))) AND A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((M2 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (M2 <= P3M2)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file FMS-PT-200-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 1203 markings, 1203 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1))))
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 (((P12M3 <= P12wM3) OR (P1 <= P2s) OR (1 <= M3) OR (1 <= P2wP1))))
lola: processed formula length: 74
lola: 38 rewrites
lola: closed formula file FMS-PT-200-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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((P12wM3 + 1 <= P12M3) AND (P2s + 1 <= P1) AND (M3 <= 0) AND (P2wP1 <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FMS-PT-200-CTLCardinality-18-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA FMS-PT-200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no no yes yes yes yes yes no no unknown yes
lola:
preliminary result: yes yes no no no no no yes yes yes yes yes no no unknown yes
lola: memory consumption: 23140 KB
lola: time consumption: 626 seconds
BK_TIME_CONFINEMENT_REACHED
--------------------
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="FMS-PT-200"
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/FMS-PT-200.tgz
mv FMS-PT-200 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 FMS-PT-200, 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 r088-blw7-152649998000087"
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 '
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 ;