fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r042-smll-152646358800171
Last Updated
June 26, 2018

About the Execution of Irma.full for ClientsAndServers-PT-N1000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.290 649851.00 539420.00 4763.80 ???????????????? 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-full
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 r042-smll-152646358800171
=====================================================================


--------------------
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 1526479326507


BK_STOP 1526479976358

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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': 'gspn'}].
CTLCardinality lola ClientsAndServers-PT-N1000P0...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
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: state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================lola:
state equation: calling and running sara
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
sara: try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality.sara.
lola: state equation: calling and running sara
sara: try reading problem file 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 295 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 354 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: SUBRESULT
lola: result: no
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.
state equation: write sara problem file to ClientsAndServers-PT-N1000P0-CTLCardinality-7.sara
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 354 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 354 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)sara:
try reading problem file ClientsAndServers-PT-N1000P0-CTLCardinality-7.sara.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: 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: state equation: calling and running sara
sara: try reading problem file 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: 4779626 markings, 6354910 edges, 3689329903141912576 markings/sec, 0 secs
lola: 8609369 markings, 12311739 edges, 765949 markings/sec, 5 secs
lola: 11927527 markings, 17841555 edges, 663632 markings/sec, 10 secs
lola: 14507043 markings, 23502016 edges, 515903 markings/sec, 15 secs
lola: 17087203 markings, 29269189 edges, 516032 markings/sec, 20 secs
lola: 19632116 markings, 34963619 edges, 508983 markings/sec, 25 secs
lola: 22160299 markings, 40623860 edges, 505637 markings/sec, 30 secs
lola: 24684710 markings, 46278192 edges, 504882 markings/sec, 35 secs
lola: 27150823 markings, 51803896 edges, 493223 markings/sec, 40 secs
lola: 29592029 markings, 57274164 edges, 488241 markings/sec, 45 secs
lola: 32052172 markings, 62788590 edges, 492029 markings/sec, 50 secs
lola: 34528249 markings, 68339724 edges, 495215 markings/sec, 55 secs
lola: 37003300 markings, 73888371 edges, 495010 markings/sec, 60 secs
lola: 39450044 markings, 79375382 edges, 489349 markings/sec, 65 secs
lola: 41918847 markings, 84911873 edges, 493761 markings/sec, 70 secs
lola: 44380917 markings, 90433027 edges, 492414 markings/sec, 75 secs
lola: 46830408 markings, 95927048 edges, 489898 markings/sec, 80 secs
lola: 49274524 markings, 101410215 edges, 488823 markings/sec, 85 secs
lola: 51713934 markings, 106881252 edges, 487882 markings/sec, 90 secs
lola: 54123172 markings, 112287032 edges, 481848 markings/sec, 95 secs
lola: 56523188 markings, 117670692 edges, 480003 markings/sec, 100 secs
lola: 58946095 markings, 123107041 edges, 484581 markings/sec, 105 secs
lola: 61378881 markings, 128565484 edges, 486557 markings/sec, 110 secs
lola: 63783474 markings, 133960627 edges, 480919 markings/sec, 115 secs
lola: 66191782 markings, 139365357 edges, 481662 markings/sec, 120 secs
lola: 68560035 markings, 144680223 edges, 473651 markings/sec, 125 secs
lola: 70955242 markings, 150053926 edges, 479041 markings/sec, 130 secs
lola: 73262829 markings, 155233697 edges, 461517 markings/sec, 135 secs
lola: 75560822 markings, 160390159 edges, 459599 markings/sec, 140 secs
lola: 77840460 markings, 165507004 edges, 455928 markings/sec, 145 secs
lola: 80115772 markings, 170612614 edges, 455062 markings/sec, 150 secs
lola: 82383638 markings, 175702816 edges, 453573 markings/sec, 155 secs
lola: 84692580 markings, 180885299 edges, 461788 markings/sec, 160 secs
lola: 87000574 markings, 186065821 edges, 461599 markings/sec, 165 secs
lola: 89295111 markings, 191215879 edges, 458907 markings/sec, 170 secs
lola: 91659898 markings, 196523954 edges, 472957 markings/sec, 175 secs
lola: 94006366 markings, 201792557 edges, 469294 markings/sec, 180 secs
lola: 96352211 markings, 207057667 edges, 469169 markings/sec, 185 secs
lola: 98686276 markings, 212296642 edges, 466813 markings/sec, 190 secs
lola: 101032463 markings, 217564504 edges, 469237 markings/sec, 195 secs
lola: 103372138 markings, 222815785 edges, 467935 markings/sec, 200 secs
lola: 105708340 markings, 228060937 edges, 467240 markings/sec, 205 secs
lola: 107989545 markings, 233182641 edges, 456241 markings/sec, 210 secs
lola: 110261786 markings, 238284192 edges, 454448 markings/sec, 215 secs
lola: 112527055 markings, 243369799 edges, 453054 markings/sec, 220 secs
lola: 114795563 markings, 248462851 edges, 453702 markings/sec, 225 secs
lola: 117103089 markings, 253643425 edges, 461505 markings/sec, 230 secs
lola: 119398705 markings, 258797414 edges, 459123 markings/sec, 235 secs
lola: 121690545 markings, 263942796 edges, 458368 markings/sec, 240 secs
lola: 123967221 markings, 269053945 edges, 455335 markings/sec, 245 secs
lola: 126281511 markings, 274249859 edges, 462858 markings/sec, 250 secs
lola: 127388330 markings, 276736344 edges, 221364 markings/sec, 255 secs
lola: 127397892 markings, 276758069 edges, 1912 markings/sec, 260 secs
lola: 127399993 markings, 276762776 edges, 420 markings/sec, 265 secs
lola: 127405556 markings, 276775059 edges, 1113 markings/sec, 270 secs
lola: 127405608 markings, 276775164 edges, 10 markings/sec, 275 secs
lola: 127411188 markings, 276787965 edges, 1116 markings/sec, 280 secs
lola: 127411205 markings, 276788000 edges, 3 markings/sec, 285 secs
lola: 127412395 markings, 276790475 edges, 238 markings/sec, 290 secs
lola: 127412418 markings, 276790530 edges, 5 markings/sec, 295 secs
lola: 127412445 markings, 276790598 edges, 5 markings/sec, 300 secs
lola: 127412463 markings, 276790645 edges, 4 markings/sec, 305 secs
lola: 127412475 markings, 276790672 edges, 2 markings/sec, 310 secs
lola: 127412487 markings, 276790703 edges, 2 markings/sec, 315 secs
lola: 127414475 markings, 276795118 edges, 398 markings/sec, 320 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 634 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: 4442153 markings, 5904967 edges, 882929 markings/sec, 0 secs
lola: 8303621 markings, 11802216 edges, 772294 markings/sec, 5 secs
lola: 11550329 markings, 17212934 edges, 649342 markings/sec, 10 secs
lola: 14203219 markings, 22823293 edges, 530578 markings/sec, 15 secs
lola: 16642968 markings, 28275683 edges, 487950 markings/sec, 20 secs
lola: 19053379 markings, 33668283 edges, 482082 markings/sec, 25 secs
lola: 21444553 markings, 39021054 edges, 478235 markings/sec, 30 secs
lola: 23834618 markings, 44373872 edges, 478013 markings/sec, 35 secs
lola: 26193950 markings, 49659698 edges, 471866 markings/sec, 40 secs
lola: 28564517 markings, 54971397 edges, 474113 markings/sec, 45 secs
lola: 30922788 markings, 60257155 edges, 471654 markings/sec, 50 secs
lola: 33272824 markings, 65525097 edges, 470007 markings/sec, 55 secs
lola: 35652980 markings, 70860706 edges, 476031 markings/sec, 60 secs
lola: 38030470 markings, 76192046 edges, 475498 markings/sec, 65 secs
lola: 40442258 markings, 81600574 edges, 482358 markings/sec, 70 secs
lola: 42894953 markings, 87100817 edges, 490539 markings/sec, 75 secs
lola: 45347625 markings, 92602023 edges, 490534 markings/sec, 80 secs
lola: 47794357 markings, 98089742 edges, 489346 markings/sec, 85 secs
lola: 50244145 markings, 103584208 edges, 489958 markings/sec, 90 secs
lola: 52691183 markings, 109073687 edges, 489408 markings/sec, 95 secs
lola: 55127688 markings, 114540912 edges, 487301 markings/sec, 100 secs
lola: 57534536 markings, 119939788 edges, 481370 markings/sec, 105 secs
lola: 59937539 markings, 125331372 edges, 480601 markings/sec, 110 secs
lola: 62348352 markings, 130740471 edges, 482163 markings/sec, 115 secs
lola: 64755189 markings, 136142044 edges, 481367 markings/sec, 120 secs
lola: 67179894 markings, 141582192 edges, 484941 markings/sec, 125 secs
lola: 69577540 markings, 146962825 edges, 479529 markings/sec, 130 secs
lola: 72017072 markings, 152437780 edges, 487906 markings/sec, 135 secs
lola: 74431613 markings, 157856447 edges, 482908 markings/sec, 140 secs
lola: 76839524 markings, 163259996 edges, 481582 markings/sec, 145 secs
lola: 79219466 markings, 168600908 edges, 475988 markings/sec, 150 secs
lola: 81592377 markings, 173927136 edges, 474582 markings/sec, 155 secs
lola: 83954126 markings, 179228624 edges, 472350 markings/sec, 160 secs
lola: 86345266 markings, 184595948 edges, 478228 markings/sec, 165 secs
lola: 88710809 markings, 189904332 edges, 473109 markings/sec, 170 secs
lola: 91065102 markings, 195190141 edges, 470859 markings/sec, 175 secs
lola: 93422476 markings, 200481481 edges, 471475 markings/sec, 180 secs
lola: 95754252 markings, 205715172 edges, 466355 markings/sec, 185 secs
lola: 98047047 markings, 210862319 edges, 458559 markings/sec, 190 secs
lola: 100388967 markings, 216119452 edges, 468384 markings/sec, 195 secs
lola: 102708470 markings, 221327295 edges, 463901 markings/sec, 200 secs
lola: 104993200 markings, 226455025 edges, 456946 markings/sec, 205 secs
lola: 107196565 markings, 231401551 edges, 440673 markings/sec, 210 secs
lola: 109384903 markings, 236314370 edges, 437668 markings/sec, 215 secs
lola: 111539854 markings, 241152147 edges, 430990 markings/sec, 220 secs
lola: 113729313 markings, 246067657 edges, 437892 markings/sec, 225 secs
lola: 115953598 markings, 251062870 edges, 444857 markings/sec, 230 secs
lola: 118120558 markings, 255927377 edges, 433392 markings/sec, 235 secs
lola: 120328885 markings, 260884957 edges, 441665 markings/sec, 240 secs
lola: 122540588 markings, 265850425 edges, 442341 markings/sec, 245 secs
lola: 124770760 markings, 270858650 edges, 446034 markings/sec, 250 secs
lola: 127066125 markings, 276012007 edges, 459073 markings/sec, 255 secs
lola: 127480556 markings, 276941986 edges, 82886 markings/sec, 260 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)
----- Kill lola and sara stderr -----
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 -----
----- 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-full"
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-full"
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 r042-smll-152646358800171"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;