About the Execution of Irma.struct for ClientsAndServers-PT-N1000P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15904.680 | 528100.00 | 528434.00 | 3350.10 | ???????????????? | 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 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N1000P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359500171
=====================================================================
--------------------
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 ClientsAndServers-PT-N1000P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N1000P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526481071722
BK_STOP 1526481599822
--------------------
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 ClientsAndServers-PT-N1000P0 as instance name.
Using ClientsAndServers 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': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 807771, 'Memory': 7724.18, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola ClientsAndServers-PT-N1000P0...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N1000P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N1000P0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ ClientsAndServers-PT-N1000P0 @ 3540 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 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: (A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si))))) AND A (X (A (F ((3 <= Si)))))) : A (G (((1 <= SF) OR (CwG + 1 <= Si) OR (((SpG <= Mi) OR (SF <= SpG)) AND (CwA <= MpG))))) : (NOT(E (((MpG <= CR) U (Uf <= StF)))) AND E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci))))) : A (G (E (X ((SA <= CwA))))) : A ((A (F ((3 <= StR))) U E (F ((Uf <= CG))))) : (((1 <= MpG) AND (SwG <= SF)) OR NOT((A (G ((3 <= StF))) OR E (F ((3 <= SpG)))))) : A (G ((E (X ((3 <= Ci))) AND ((MpA <= 2) AND (SpA <= 2))))) : (E (F (((1 <= Mi) AND (Ci <= Mi) AND (SG <= 0)))) OR (E (X ((CwG <= MpA))) AND A (G (((3 <= CG) OR (Cb <= SwA)))))) : NOT(NOT(E (G ((SG <= CR))))) : E (G (((SA <= 0) AND (MwU <= 0) AND ((SA <= 1) OR (CF + 1 <= SR))))) : (E (G (((SF <= 1) AND (CwA <= MtF)))) AND A (((SpA + 1 <= SR) U ((MwU <= StR) AND (SpG <= CwG))))) : E (G ((CF <= 0))) : (A (F (((Uf <= 1) AND (SG <= 1)))) OR E ((((1 <= Si) OR (CwA <= CwG)) U (Mi <= 2)))) : A (G (A (F (((2 <= MwU) OR (SF <= StF)))))) : E (F ((2 <= MtF))) : E ((((SpA <= 2) OR (CwG <= 1)) U ((Mi <= 2) AND (MpG + 1 <= Mi))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si))))) AND A (X (A (F ((3 <= Si))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= SpA) OR (SpG <= MwU) OR ((StR <= Ci) AND (1 <= Si)))))
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 68 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 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4006 markings, 4005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SF) OR (CwG + 1 <= Si) OR (((SpG <= Mi) OR (SF <= SpG)) AND (CwA <= MpG)))))
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 68 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7006 markings, 7005 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (((MpG <= CR) U (Uf <= StF)))) AND E (((StR <= 1) U ((2 <= MwU) AND (SR <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CR + 1 <= MpG) R (StF + 1 <= Uf)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CR + 1 <= MpG) R (StF + 1 <= Uf)))
lola: processed formula: A (((CR + 1 <= MpG) R (StF + 1 <= Uf)))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 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: 50001 markings, 50001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((SA <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((SA <= CwA)))))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 50001 markings, 50000 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((3 <= StR))) U E (F ((Uf <= CG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (3 <= StR)) U E(TRUE U (Uf <= CG)))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 3 significant temporal operators and needs 13 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: 43990 markings, 43990 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= MpG) AND (SwG <= SF)) OR NOT((A (G ((3 <= StF))) OR E (F ((3 <= SpG))))))
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: ((1 <= MpG) AND (SwG <= SF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= MpG) AND (SwG <= SF))
lola: processed formula length: 28
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((StF <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SpG <= 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 68 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-7.sara
lola: SUBRESULT
lola: lola: result: nostate equation: calling and running sara
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((3 <= Ci))) AND ((MpA <= 2) AND (SpA <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((3 <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((3 <= Ci)))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7999 markings, 7998 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= Mi) AND (Ci <= Mi) AND (SG <= 0)))) OR (E (X ((CwG <= MpA))) AND A (G (((3 <= CG) OR (Cb <= SwA))))))
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: E (F (((1 <= Mi) AND (Ci <= Mi) AND (SG <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G ((SG <= CR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (CR + 1 <= SG)))
lola: processed formula length: 29
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 50001 markings, 50000 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((SA <= 0) AND (MwU <= 0) AND ((SA <= 1) OR (CF + 1 <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= SA) OR (1 <= MwU) OR ((2 <= SA) AND (SR <= CF)))))
lola: processed formula length: 72
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 4012001 markings, 6011000 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((SF <= 1) AND (CwA <= MtF)))) AND A (((SpA + 1 <= SR) U ((MwU <= StR) AND (SpG <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((SF <= 1) AND (CwA <= MtF))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= SF) OR (MtF + 1 <= CwA))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 4840318 markings, 6435828 edges, 3689329903141912576 markings/sec, 0 secs
lola: 8571550 markings, 12248716 edges, 746246 markings/sec, 5 secs
lola: 11470125 markings, 17079269 edges, 579715 markings/sec, 10 secs
lola: 14071160 markings, 22528491 edges, 520207 markings/sec, 15 secs
lola: 16584284 markings, 28144291 edges, 502625 markings/sec, 20 secs
lola: 19043400 markings, 33645917 edges, 491823 markings/sec, 25 secs
lola: 21527562 markings, 39207516 edges, 496832 markings/sec, 30 secs
lola: 24022737 markings, 44795574 edges, 499035 markings/sec, 35 secs
lola: 26485977 markings, 50313952 edges, 492648 markings/sec, 40 secs
lola: 28959871 markings, 55857745 edges, 494779 markings/sec, 45 secs
lola: 31401431 markings, 61329970 edges, 488312 markings/sec, 50 secs
lola: 33858746 markings, 66838509 edges, 491463 markings/sec, 55 secs
lola: 36330525 markings, 72379837 edges, 494356 markings/sec, 60 secs
lola: 38784561 markings, 77883393 edges, 490807 markings/sec, 65 secs
lola: 41249197 markings, 83409317 edges, 492927 markings/sec, 70 secs
lola: 43714521 markings, 88939060 edges, 493065 markings/sec, 75 secs
lola: 46187583 markings, 94484945 edges, 494612 markings/sec, 80 secs
lola: 48649445 markings, 100007700 edges, 492372 markings/sec, 85 secs
lola: 51116016 markings, 105540010 edges, 493314 markings/sec, 90 secs
lola: 53558064 markings, 111018307 edges, 488410 markings/sec, 95 secs
lola: 55986214 markings, 116466334 edges, 485630 markings/sec, 100 secs
lola: 58437971 markings, 121966507 edges, 490351 markings/sec, 105 secs
lola: 60914253 markings, 127522588 edges, 495256 markings/sec, 110 secs
lola: 63383237 markings, 133062417 edges, 493797 markings/sec, 115 secs
lola: 65856070 markings, 138612228 edges, 494567 markings/sec, 120 secs
lola: 68299399 markings, 144094239 edges, 488666 markings/sec, 125 secs
lola: 70762896 markings, 149623005 edges, 492699 markings/sec, 130 secs
lola: 73209719 markings, 155114203 edges, 489365 markings/sec, 135 secs
lola: 75674285 markings, 160645223 edges, 492913 markings/sec, 140 secs
lola: 78124109 markings, 166143116 edges, 489965 markings/sec, 145 secs
lola: 80562219 markings, 171614648 edges, 487622 markings/sec, 150 secs
lola: 82980970 markings, 177044038 edges, 483750 markings/sec, 155 secs
lola: 85441232 markings, 182566964 edges, 492052 markings/sec, 160 secs
lola: 87898199 markings, 188080424 edges, 491393 markings/sec, 165 secs
lola: 90328978 markings, 193536903 edges, 486156 markings/sec, 170 secs
lola: 92784043 markings, 199047721 edges, 491013 markings/sec, 175 secs
lola: 95206856 markings, 204486176 edges, 484563 markings/sec, 180 secs
lola: 97631685 markings, 209929214 edges, 484966 markings/sec, 185 secs
lola: 100062900 markings, 215388135 edges, 486243 markings/sec, 190 secs
lola: 102470795 markings, 220792811 edges, 481579 markings/sec, 195 secs
lola: 104884310 markings, 226210346 edges, 482703 markings/sec, 200 secs
lola: 107286540 markings, 231603851 edges, 480446 markings/sec, 205 secs
lola: 109674226 markings, 236964923 edges, 477537 markings/sec, 210 secs
lola: 112037557 markings, 242269512 edges, 472666 markings/sec, 215 secs
lola: 114401813 markings, 247577566 edges, 472851 markings/sec, 220 secs
lola: 116808244 markings, 252980572 edges, 481286 markings/sec, 225 secs
lola: 119213538 markings, 258381026 edges, 481059 markings/sec, 230 secs
lola: 121606051 markings, 263752705 edges, 478503 markings/sec, 235 secs
lola: 123982988 markings, 269089422 edges, 475387 markings/sec, 240 secs
lola: 126189640 markings, 274043556 edges, 441330 markings/sec, 245 secs
lola: 127377656 markings, 276712363 edges, 237603 markings/sec, 250 secs
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: '
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CF <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= CF)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N1000P0-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: 4393084 markings, 5839544 edges, 873115 markings/sec, 0 secs
lola: 7838328 markings, 11026814 edges, 689049 markings/sec, 5 secs
lola: 10576729 markings, 15590385 edges, 547680 markings/sec, 10 secs
lola: 13211610 markings, 20611505 edges, 526976 markings/sec, 15 secs
lola: 15724572 markings, 26221917 edges, 502592 markings/sec, 20 secs
lola: 18205065 markings, 31769761 edges, 496099 markings/sec, 25 secs
lola: 20662650 markings, 37270442 edges, 491517 markings/sec, 30 secs
lola: 23104716 markings, 42739311 edges, 488413 markings/sec, 35 secs
lola: 25537417 markings, 48188451 edges, 486540 markings/sec, 40 secs
lola: 27943984 markings, 53581067 edges, 481313 markings/sec, 45 secs
lola: 30360300 markings, 58996299 edges, 483263 markings/sec, 50 secs
lola: 32758315 markings, 64371272 edges, 479603 markings/sec, 55 secs
lola: 35053957 markings, 69517835 edges, 459128 markings/sec, 60 secs
lola: 37431391 markings, 74848143 edges, 475487 markings/sec, 65 secs
lola: 39558136 markings, 79617161 edges, 425349 markings/sec, 70 secs
lola: 41951588 markings, 84985295 edges, 478690 markings/sec, 75 secs
lola: 44351088 markings, 90366023 edges, 479900 markings/sec, 80 secs
lola: 46734123 markings, 95710848 edges, 476607 markings/sec, 85 secs
lola: 49116327 markings, 101054488 edges, 476441 markings/sec, 90 secs
lola: 51540938 markings, 106493676 edges, 484922 markings/sec, 95 secs
lola: 54020723 markings, 112056782 edges, 495957 markings/sec, 100 secs
lola: 56486081 markings, 117587254 edges, 493072 markings/sec, 105 secs
lola: 58977258 markings, 123177091 edges, 498235 markings/sec, 110 secs
lola: 61460374 markings, 128748726 edges, 496623 markings/sec, 115 secs
lola: 63590112 markings, 133527337 edges, 425948 markings/sec, 120 secs
lola: 65981159 markings, 138891977 edges, 478209 markings/sec, 125 secs
lola: 68346017 markings, 144198966 edges, 472972 markings/sec, 130 secs
lola: 70809049 markings, 149726666 edges, 492606 markings/sec, 135 secs
lola: 73328279 markings, 155379416 edges, 503846 markings/sec, 140 secs
lola: 75837847 markings, 161011466 edges, 501914 markings/sec, 145 secs
lola: 78341229 markings, 166629928 edges, 500676 markings/sec, 150 secs
lola: 80835137 markings, 172228167 edges, 498782 markings/sec, 155 secs
lola: 83328989 markings, 177824709 edges, 498770 markings/sec, 160 secs
lola: 85857632 markings, 183501243 edges, 505729 markings/sec, 165 secs
lola: 88356792 markings, 189109796 edges, 499832 markings/sec, 170 secs
lola: 90785629 markings, 194561822 edges, 485767 markings/sec, 175 secs
lola: 93161277 markings, 199894201 edges, 475130 markings/sec, 180 secs
lola: 95537861 markings, 205228879 edges, 475317 markings/sec, 185 secs
lola: 97925281 markings, 210589307 edges, 477484 markings/sec, 190 secs
lola: 100294646 markings, 215907282 edges, 473873 markings/sec, 195 secs
lola: 102617585 markings, 221122807 edges, 464588 markings/sec, 200 secs
lola: 104978433 markings, 226421759 edges, 472170 markings/sec, 205 secs
lola: 107354780 markings, 231757256 edges, 475269 markings/sec, 210 secs
lola: 109686342 markings, 236992025 edges, 466312 markings/sec, 215 secs
lola: 111979906 markings, 242141478 edges, 458713 markings/sec, 220 secs
lola: 114257018 markings, 247253769 edges, 455422 markings/sec, 225 secs
lola: 116517541 markings, 252328922 edges, 452105 markings/sec, 230 secs
lola: 118819132 markings, 257496207 edges, 460318 markings/sec, 235 secs
lola: 121099967 markings, 262616792 edges, 456167 markings/sec, 240 secs
lola: 123508613 markings, 268024627 edges, 481729 markings/sec, 245 secs
lola: 125932090 markings, 273466112 edges, 484695 markings/sec, 250 secs
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)
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N1000P0-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="ClientsAndServers-PT-N1000P0"
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/ClientsAndServers-PT-N1000P0.tgz
mv ClientsAndServers-PT-N1000P0 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 ClientsAndServers-PT-N1000P0, 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 r043-smll-152646359500171"
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 ;