About the Execution of Irma.struct for HexagonalGrid-PT-410
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9454.660 | 512822.00 | 517537.00 | 1733.70 | ???????????????? | 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 1.1M
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 873K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is HexagonalGrid-PT-410, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633500031
=====================================================================
--------------------
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 HexagonalGrid-PT-410-CTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-410-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526717226213
BK_STOP 1526717739035
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using HexagonalGrid-PT-410 as instance name.
Using HexagonalGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1216516, 'Memory': 15950.04, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola HexagonalGrid-PT-410...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
HexagonalGrid-PT-410: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
HexagonalGrid-PT-410: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ HexagonalGrid-PT-410 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2161/65536 symbol table entries, 431 collisions
lola: preprocessing...
lola: finding significant places
lola: 787 places, 1374 transitions, 485 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1675 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-410-CTLCardinality.task
lola: E (X (A (G ((pb1_2_4 + 1 <= pol1_4_3))))) : NOT(E (F (E (G ((pb6_3_4 <= pil2_7_1)))))) : A (F (A (((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3))))) : NOT(E (F ((((2 <= po2_7_3) AND (pb2_6_1 <= pol1_4_2)) OR (3 <= pol1_3_2))))) : (NOT(E (G (((pil2_2_2 <= pb4_5_5) OR (2 <= pb4_6_4))))) AND (A (((pil1_5_4 <= pol1_4_6) U (po3_5_1 <= pil2_4_2))) OR NOT(A (G ((pol1_4_6 <= pol3_6_3)))))) : NOT(((E (G ((2 <= pb2_4_4))) OR ((1 <= pi5_2_1) OR (2 <= po2_3_1))) OR (A (F ((pil1_4_1 <= pbl_3_2))) AND E (F ((2 <= pb3_3_5)))))) : A ((A (F ((pbl_6_5 <= pil3_2_5))) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4)))) : (NOT(E (F (((2 <= pb5_4_3) AND (pil2_6_4 <= pil2_6_2))))) AND A (F (E (X ((1 <= po1_1_3)))))) : (E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))) OR E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6)))) : E ((E (X ((pb4_3_5 <= pol3_4_2))) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7)))) : (E (G (((pol5_4_1 <= pb2_2_1) OR (3 <= pb4_2_5) OR ((pil1_4_2 <= pil1_6_1) AND (1 <= pol1_3_2))))) OR (A (X ((2 <= pi2_5_1))) OR (E (G ((pb3_4_4 <= pi2_5_5))) AND ((3 <= pb6_2_3) AND (pil2_2_4 <= pb6_2_2) AND (2 <= po1_5_3) AND (pi2_4_1 <= po6_4_1))))) : A (X (E (F ((3 <= pil2_5_2))))) : (E (X (A (G ((pb4_1_2 <= pil2_2_3))))) OR NOT(E (G ((pi3_7_3 + 1 <= pol1_1_1))))) : (((A (G ((2 <= pol4_7_1))) OR (((po1_4_7 <= po2_7_4) OR (1 <= pi6_3_1)) AND (pol2_6_2 <= po3_4_4))) AND E (X (((po3_4_4 <= pil2_6_2) AND (3 <= pb1_2_2))))) OR E (F (A (G ((3 <= pb3_2_1)))))) : E (G ((((pil3_3_5 <= po1_3_3) OR ((2 <= pol2_4_1) AND (pil1_3_2 <= po3_5_1))) OR E (X ((pi3_6_5 <= po3_3_1)))))) : (A (X (((pb4_4_4 <= 1) OR (pol3_4_3 <= pil3_5_5)))) AND (E (((pb3_1_2 <= pi3_7_1) U (1 <= po1_4_4))) OR E (G (((3 <= pil1_5_4) OR (po2_7_1 <= pol5_4_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((pb1_2_4 + 1 <= pol1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (pol1_4_3 <= pb1_2_4))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1424 markings, 1423 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((pb6_3_4 <= pil2_7_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (pil2_7_1 + 1 <= pb6_3_4)))))
lola: processed formula length: 55
lola: 7 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1257 markings, 1257 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3)))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1296 markings, 3741 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((2 <= po2_7_3) AND (pb2_6_1 <= pol1_4_2)) OR (3 <= pol1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-410-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file HexagonalGrid-PT-410-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((pil2_2_2 <= pb4_5_5) OR (2 <= pb4_6_4))))) AND (A (((pil1_5_4 <= pol1_4_6) U (po3_5_1 <= pil2_4_2))) OR NOT(A (G ((pol1_4_6 <= pol3_6_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: processed formula: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: processed formula length: 54
lola: 6 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1325 markings, 1325 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= pb2_4_4))) OR ((1 <= pi5_2_1) OR (2 <= po2_3_1))) OR (A (F ((pil1_4_1 <= pbl_3_2))) AND E (F ((2 <= pb3_3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb2_4_4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pb2_4_4 <= 1)))
lola: processed formula: A (F ((pb2_4_4 <= 1)))
lola: processed formula length: 22
lola: 14 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi5_2_1 <= 0) AND (po2_3_1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi5_2_1 <= 0) AND (po2_3_1 <= 1))
lola: processed formula length: 35
lola: 14 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: processed formula with 2 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pbl_3_2 + 1 <= pil1_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil1_4_1 <= pbl_3_2)))
lola: processed formula length: 36
lola: 16 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1610 markings, 1610 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((pbl_6_5 <= pil3_2_5))) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (pbl_6_5 <= pil3_2_5)) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4)))
lola: processed formula length: 92
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1291 markings, 2526 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= pb5_4_3) AND (pil2_6_4 <= pil2_6_2))))) AND A (F (E (X ((1 <= po1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb5_4_3 <= 1) OR (pil2_6_2 + 1 <= pil2_6_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to HexagonalGrid-PT-410-CTLCardinality-7.saralola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: ========================================lola:
subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))) OR E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file HexagonalGrid-PT-410-CTLCardinality-7.sara.
lola: processed formula: E(((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1211 markings, 1210 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((pb4_3_5 <= pol3_4_2))) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((pb4_3_5 <= pol3_4_2)) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic
lola: 278866 markings, 1365152 edges, 3689329903141912576 markings/sec, 0 secs
lola: 548919 markings, 2610193 edges, 54011 markings/sec, 5 secs
lola: 770993 markings, 3633525 edges, 44415 markings/sec, 10 secs
lola: 842300 markings, 4695674 edges, 14261 markings/sec, 15 secs
lola: 888260 markings, 5809693 edges, 9192 markings/sec, 20 secs
lola: 1143816 markings, 7095262 edges, 51111 markings/sec, 25 secs
lola: 1394330 markings, 8259289 edges, 50103 markings/sec, 30 secs
lola: 1611792 markings, 9240932 edges, 43492 markings/sec, 35 secs
lola: 1699754 markings, 10196791 edges, 17592 markings/sec, 40 secs
lola: 1704979 markings, 11200449 edges, 1045 markings/sec, 45 secs
lola: 1928407 markings, 12412549 edges, 44686 markings/sec, 50 secs
lola: 2162669 markings, 13634887 edges, 46852 markings/sec, 55 secs
lola: 2403504 markings, 14556334 edges, 48167 markings/sec, 60 secs
lola: 2537122 markings, 15484672 edges, 26724 markings/sec, 65 secs
lola: 2548336 markings, 16492586 edges, 2243 markings/sec, 70 secs
lola: 2680200 markings, 17591123 edges, 26373 markings/sec, 75 secs
lola: 2921501 markings, 18839390 edges, 48260 markings/sec, 80 secs
lola: 3148260 markings, 19837892 edges, 45352 markings/sec, 85 secs
lola: 3219924 markings, 20840214 edges, 14333 markings/sec, 90 secs
lola: 3327312 markings, 21859745 edges, 21478 markings/sec, 95 secs
lola: 3535545 markings, 22939954 edges, 41647 markings/sec, 100 secs
lola: 3752330 markings, 23864872 edges, 43357 markings/sec, 105 secs
lola: 3934577 markings, 24733298 edges, 36449 markings/sec, 110 secs
lola: 4017740 markings, 25611480 edges, 16633 markings/sec, 115 secs
lola: 4023307 markings, 26516048 edges, 1113 markings/sec, 120 secs
lola: 4197076 markings, 27581272 edges, 34754 markings/sec, 125 secs
lola: 4422549 markings, 28748242 edges, 45095 markings/sec, 130 secs
lola: 4653720 markings, 29635859 edges, 46234 markings/sec, 135 secs
lola: 4785425 markings, 30537682 edges, 26341 markings/sec, 140 secs
lola: 4796640 markings, 31504422 edges, 2243 markings/sec, 145 secs
lola: 4878057 markings, 32426077 edges, 16283 markings/sec, 150 secs
lola: 5033668 markings, 33384269 edges, 31122 markings/sec, 155 secs
lola: 5208916 markings, 34394627 edges, 35050 markings/sec, 160 secs
lola: 5398177 markings, 35133376 edges, 37852 markings/sec, 165 secs
lola: 5541981 markings, 35949998 edges, 28761 markings/sec, 170 secs
lola: 5567038 markings, 36762392 edges, 5011 markings/sec, 175 secs
lola: 5571252 markings, 37565502 edges, 843 markings/sec, 180 secs
lola: 5679984 markings, 38501088 edges, 21746 markings/sec, 185 secs
lola: 5895849 markings, 39661756 edges, 43173 markings/sec, 190 secs
lola: 6132510 markings, 40546320 edges, 47332 markings/sec, 195 secs
lola: 6302652 markings, 41444192 edges, 34028 markings/sec, 200 secs
lola: 6316247 markings, 42395314 edges, 2719 markings/sec, 205 secs
lola: 6361945 markings, 43322136 edges, 9140 markings/sec, 210 secs
lola: 6518337 markings, 44281914 edges, 31278 markings/sec, 215 secs
lola: 6688142 markings, 45315932 edges, 33961 markings/sec, 220 secs
lola: 6849667 markings, 46048362 edges, 32305 markings/sec, 225 secs
lola: 6982391 markings, 46870420 edges, 26545 markings/sec, 230 secs
lola: 7057155 markings, 47658946 edges, 14953 markings/sec, 235 secs
lola: 7064347 markings, 48527122 edges, 1438 markings/sec, 240 secs
lola: 7188070 markings, 49512356 edges, 24745 markings/sec, 245 secs
lola: 7420436 markings, 50692937 edges, 46473 markings/sec, 250 secs
lola: 7652588 markings, 51609990 edges, 46430 markings/sec, 255 secs
lola: 7773766 markings, 52512797 edges, 24236 markings/sec, 260 secs
lola: 7784115 markings, 53501131 edges, 2070 markings/sec, 265 secs
lola: 7886018 markings, 54467398 edges, 20381 markings/sec, 270 secs
lola: 8057545 markings, 55561478 edges, 34305 markings/sec, 275 secs
lola: 8239341 markings, 56423435 edges, 36359 markings/sec, 280 secs
lola: 8395864 markings, 57283865 edges, 31305 markings/sec, 285 secs
lola: 8492393 markings, 58093643 edges, 19306 markings/sec, 290 secs
lola: 8503162 markings, 59006460 edges, 2154 markings/sec, 295 secs
lola: 8568136 markings, 59863749 edges, 12995 markings/sec, 300 secs
lola: 8750634 markings, 60824677 edges, 36500 markings/sec, 305 secs
lola: 8942376 markings, 61602040 edges, 38348 markings/sec, 310 secs
lola: 9104738 markings, 62353683 edges, 32472 markings/sec, 315 secs
lola: 9199958 markings, 63118822 edges, 19044 markings/sec, 320 secs
lola: 9209491 markings, 63919960 edges, 1907 markings/sec, 325 secs
lola: 9261435 markings, 64699227 edges, 10389 markings/sec, 330 secs
lola: 9433064 markings, 65606185 edges, 34326 markings/sec, 335 secs
lola: 9617052 markings, 66371694 edges, 36798 markings/sec, 340 secs
lola: 9779411 markings, 67072953 edges, 32472 markings/sec, 345 secs
lola: 9890850 markings, 67807162 edges, 22288 markings/sec, 350 secs
lola: 9901796 markings, 68559933 edges, 2189 markings/sec, 355 secs
lola: 9904319 markings, 69269832 edges, 505 markings/sec, 360 secs
lola: 10120472 markings, 70424063 edges, 43231 markings/sec, 365 secs
lola: 10357400 markings, 71349781 edges, 47386 markings/sec, 370 secs
lola: 10539275 markings, 72266009 edges, 36375 markings/sec, 375 secs
lola: 10569179 markings, 73213029 edges, 5981 markings/sec, 380 secs
lola: 10598340 markings, 74143254 edges, 5832 markings/sec, 385 secs
lola: 10761399 markings, 75151534 edges, 32612 markings/sec, 390 secs
lola: 10920379 markings, 76012707 edges, 31796 markings/sec, 395 secs
lola: 11075134 markings, 76769478 edges, 30951 markings/sec, 400 secs
lola: 11201856 markings, 77564198 edges, 25344 markings/sec, 405 secs
lola: 11235695 markings, 78400059 edges, 6768 markings/sec, 410 secs
lola: 11239712 markings, 79228205 edges, 803 markings/sec, 415 secs
lola: 11428321 markings, 80361674 edges, 37722 markings/sec, 420 secs
lola: 11672074 markings, 81311904 edges, 48751 markings/sec, 425 secs
lola: 11856507 markings, 82246232 edges, 36887 markings/sec, 430 secs
lola: 11880250 markings, 83218302 edges, 4749 markings/sec, 435 secs
lola: 11919165 markings, 84148854 edges, 7783 markings/sec, 440 secs
lola: 12091966 markings, 85237316 edges, 34560 markings/sec, 445 secs
lola: 12271553 markings, 86079112 edges, 35917 markings/sec, 450 secs
lola: 12418757 markings, 86901568 edges, 29441 markings/sec, 455 secs
lola: 12513628 markings, 87694277 edges, 18974 markings/sec, 460 secs
lola: 12524013 markings, 88592317 edges, 2077 markings/sec, 465 secs
lola: 12581087 markings, 89420719 edges, 11415 markings/sec, 470 secs
lola: 12750891 markings, 90359075 edges, 33961 markings/sec, 475 secs
lola: 12938174 markings, 91011589 edges, 37457 markings/sec, 480 secs
lola: 13080440 markings, 91730601 edges, 28453 markings/sec, 485 secs
lola: 13149119 markings, 92473649 edges, 13736 markings/sec, 490 secs
lola: 13154799 markings, 93212324 edges, 1136 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
----- Kill lola and sara stderr -----
FORMULA HexagonalGrid-PT-410-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="HexagonalGrid-PT-410"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/HexagonalGrid-PT-410.tgz
mv HexagonalGrid-PT-410 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 irma4mcc-structural"
echo " Input is HexagonalGrid-PT-410, 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 r103-smll-152658633500031"
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 ;