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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N2000P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359500178
=====================================================================

--------------------
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-N2000P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526481614047


BK_STOP 1526482233450

--------------------
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-N2000P0 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': 1235484, 'Memory': 15951.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola ClientsAndServers-PT-N2000P0...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ClientsAndServers-PT-N2000P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N2000P0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N2000P0 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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-N2000P0-CTLCardinality.task
lola: NOT(A (((MtF <= SwA) U (CR + 1 <= SpG)))) : (E (((2 <= CwA) U ((Cb <= SpA) AND (2 <= CwG)))) OR A (G (A (G ((SG <= SwG)))))) : A (G ((E (F ((MwU <= Uf))) AND (CG <= 2)))) : A (G (A (((3 <= SpG) U (2 <= Si))))) : (A (G (E (F ((SpA <= CG))))) AND E ((((Mi <= SwG) OR (Cb <= StR)) U (3 <= MwU)))) : (E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG)))) AND (MwU <= CR)) : ((E (G (((SwG <= SF) AND (SR <= CwA)))) AND ((SF <= CG) OR E (G ((3 <= SF))))) OR A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA)))))) : (A (G (E (F ((CG <= SF))))) OR ((((3 <= CwG) AND (StF + 1 <= MpG)) OR ((SpA + 1 <= SA) AND (CA <= 2))) AND E (F ((SR + 1 <= MwU))))) : E (G ((A (F ((MwU <= Cb))) AND (MwU <= Ci)))) : A (X (E (((SwG <= MtF) U (2 <= Cb))))) : E (F ((A (X ((SpA <= SR))) AND ((SA <= Ci) AND (Si <= SpA) AND (1 <= CG))))) : NOT(A (F (((MwU + 1 <= Cb) AND (CwG <= 2))))) : NOT(((E (X ((SwA <= SwG))) OR ((1 <= MpA) AND (MtF <= SwA) AND ((2 <= SpG) OR (SpG <= SwA)))) AND A (F (((2 <= MtF) OR (1 <= CA)))))) : A (G ((A (X ((1 <= Si))) OR ((CF <= 0) OR (SwA <= 2))))) : NOT(A (G ((SF <= 2)))) : NOT(A (G ((3 <= Uf))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (((MtF <= SwA) U (CR + 1 <= SpG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((MtF <= SwA) U (CR + 1 <= SpG)))
lola: processed formula length: 38
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((2 <= CwA) U ((Cb <= SpA) AND (2 <= CwG)))) OR A (G (A (G ((SG <= SwG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= CwA) U ((Cb <= SpA) AND (2 <= CwG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= CwA) U ((Cb <= SpA) AND (2 <= CwG)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SG <= SwG)))
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-N2000P0-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-CTLCardinality-2.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((MwU <= Uf))) AND (CG <= 2))))
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 (G (E (F ((MwU <= Uf)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (MwU <= Uf)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 176001 markings, 311983 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 (A (((3 <= SpG) U (2 <= Si)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((3 <= SpG) U (2 <= Si)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 35992 markings, 71983 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((SpA <= CG))))) AND E ((((Mi <= SwG) OR (Cb <= StR)) U (3 <= MwU))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((SpA <= CG)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (SpA <= CG)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2816916 markings, 9658141 edges, 2228190962574688256 markings/sec, 0 secs
lola: 5402896 markings, 18688315 edges, 517196 markings/sec, 5 secs
lola: 8106782 markings, 28135918 edges, 540777 markings/sec, 10 secs
lola: 10815081 markings, 37601299 edges, 541660 markings/sec, 15 secs
lola: 13564018 markings, 47210056 edges, 549787 markings/sec, 20 secs
lola: 16302858 markings, 56784672 edges, 547768 markings/sec, 25 secs
lola: 18945844 markings, 66024834 edges, 528597 markings/sec, 30 secs
lola: 21637690 markings, 75436586 edges, 538369 markings/sec, 35 secs
lola: 24389200 markings, 85059315 edges, 550302 markings/sec, 40 secs
lola: 27058664 markings, 94393017 edges, 533893 markings/sec, 45 secs
lola: 29758843 markings, 103834706 edges, 540036 markings/sec, 50 secs
lola: 32463236 markings, 113293134 edges, 540879 markings/sec, 55 secs
lola: 35246069 markings, 123027293 edges, 556567 markings/sec, 60 secs
lola: 37859324 markings, 132165184 edges, 522651 markings/sec, 65 secs
lola: 40489476 markings, 141365048 edges, 526030 markings/sec, 70 secs
lola: 42966909 markings, 150030141 edges, 495487 markings/sec, 75 secs
lola: 45633153 markings, 159354916 edges, 533249 markings/sec, 80 secs
lola: 48334065 markings, 168801321 edges, 540182 markings/sec, 85 secs
lola: 50953224 markings, 177963028 edges, 523832 markings/sec, 90 secs
lola: 53589222 markings, 187184841 edges, 527200 markings/sec, 95 secs
lola: 56289523 markings, 196627721 edges, 540060 markings/sec, 100 secs
lola: 58934051 markings, 205880490 edges, 528906 markings/sec, 105 secs
lola: 61647175 markings, 215369908 edges, 542625 markings/sec, 110 secs
lola: 64428415 markings, 225013343 edges, 556248 markings/sec, 115 secs
lola: 66684258 markings, 233972626 edges, 451169 markings/sec, 120 secs
lola: 68876543 markings, 242712727 edges, 438457 markings/sec, 125 secs
lola: 71102113 markings, 251592263 edges, 445114 markings/sec, 130 secs
lola: 73286853 markings, 260312354 edges, 436948 markings/sec, 135 secs
lola: 75435741 markings, 268891517 edges, 429778 markings/sec, 140 secs
lola: 77596616 markings, 277520091 edges, 432175 markings/sec, 145 secs
lola: 79773784 markings, 286214890 edges, 435434 markings/sec, 150 secs
lola: 81932279 markings, 294836088 edges, 431699 markings/sec, 155 secs
lola: 84088815 markings, 303450196 edges, 431307 markings/sec, 160 secs
lola: 86277831 markings, 312194732 edges, 437803 markings/sec, 165 secs
lola: 88469573 markings, 320950684 edges, 438348 markings/sec, 170 secs
lola: 90701941 markings, 329869482 edges, 446474 markings/sec, 175 secs
lola: 92948189 markings, 338844135 edges, 449250 markings/sec, 180 secs
lola: 95219056 markings, 347917609 edges, 454173 markings/sec, 185 secs
lola: 97566615 markings, 356855190 edges, 469512 markings/sec, 190 secs
lola: 99866547 markings, 366023523 edges, 459986 markings/sec, 195 secs
lola: 102107507 markings, 374967868 edges, 448192 markings/sec, 200 secs
lola: 104329528 markings, 383840446 edges, 444404 markings/sec, 205 secs
lola: 106576985 markings, 392816835 edges, 449491 markings/sec, 210 secs
lola: 108825898 markings, 401800482 edges, 449783 markings/sec, 215 secs
lola: 110341562 markings, 407855715 edges, 303133 markings/sec, 220 secs
lola: 110347854 markings, 407880848 edges, 1258 markings/sec, 225 secs
lola: 110354669 markings, 407908073 edges, 1363 markings/sec, 230 secs
lola: 110357972 markings, 407921288 edges, 661 markings/sec, 235 secs
lola: 110358000 markings, 407921397 edges, 6 markings/sec, 240 secs
lola: 110361298 markings, 407934554 edges, 660 markings/sec, 245 secs
lola: 110361312 markings, 407934613 edges, 3 markings/sec, 250 secs
lola: 110363671 markings, 407944046 edges, 472 markings/sec, 255 secs
lola: 110363685 markings, 407944102 edges, 3 markings/sec, 260 secs
lola: 110363697 markings, 407944151 edges, 2 markings/sec, 265 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 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG)))) AND (MwU <= CR))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG))))
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-N2000P0-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-CTLCardinality-5.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================lola: SUBRESULT
lola:
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((SwG <= SF) AND (SR <= CwA)))) AND ((SF <= CG) OR E (G ((3 <= SF))))) OR A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((SwG <= SF) AND (SR <= CwA))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((SF + 1 <= SwG) OR (CwA + 1 <= SR))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 24001 markings, 24000 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA)))))
lola: processed formula: A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA)))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 24001 markings, 24000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((CG <= SF))))) OR ((((3 <= CwG) AND (StF + 1 <= MpG)) OR ((SpA + 1 <= SA) AND (CA <= 2))) AND E (F ((SR + 1 <= MwU)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((CG <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (CG <= SF)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2139420 markings, 9339140 edges, 2994657632079314944 markings/sec, 0 secs
lola: 4328612 markings, 19169476 edges, 437838 markings/sec, 5 secs
lola: 6450946 markings, 28705361 edges, 424467 markings/sec, 10 secs
lola: 8621554 markings, 38459909 edges, 434122 markings/sec, 15 secs
lola: 10758698 markings, 48065708 edges, 427429 markings/sec, 20 secs
lola: 12936523 markings, 57855665 edges, 435565 markings/sec, 25 secs
lola: 15154255 markings, 67826418 edges, 443546 markings/sec, 30 secs
lola: 17233740 markings, 77174382 edges, 415897 markings/sec, 35 secs
lola: 19350023 markings, 86688677 edges, 423257 markings/sec, 40 secs
lola: 21480915 markings, 96272052 edges, 426178 markings/sec, 45 secs
lola: 23657235 markings, 106056207 edges, 435264 markings/sec, 50 secs
lola: 25808066 markings, 115728219 edges, 430166 markings/sec, 55 secs
lola: 27911727 markings, 125188137 edges, 420732 markings/sec, 60 secs
lola: 30075235 markings, 134918869 edges, 432702 markings/sec, 65 secs
lola: 32214899 markings, 144541141 edges, 427933 markings/sec, 70 secs
lola: 34390417 markings, 154323842 edges, 435104 markings/sec, 75 secs
lola: 36534966 markings, 163968622 edges, 428910 markings/sec, 80 secs
lola: 38617812 markings, 173335051 edges, 416569 markings/sec, 85 secs
lola: 40715711 markings, 182771565 edges, 419580 markings/sec, 90 secs
lola: 42843620 markings, 192341337 edges, 425582 markings/sec, 95 secs
lola: 44951845 markings, 201822910 edges, 421645 markings/sec, 100 secs
lola: 47120248 markings, 211575641 edges, 433681 markings/sec, 105 secs
lola: 49303968 markings, 221395183 edges, 436744 markings/sec, 110 secs
lola: 51413774 markings, 230884862 edges, 421961 markings/sec, 115 secs
lola: 53596758 markings, 240704905 edges, 436597 markings/sec, 120 secs
lola: 55821241 markings, 250708922 edges, 444897 markings/sec, 125 secs
lola: 58026843 markings, 260631641 edges, 441120 markings/sec, 130 secs
lola: 60267927 markings, 270710452 edges, 448217 markings/sec, 135 secs
lola: 62544551 markings, 280950471 edges, 455325 markings/sec, 140 secs
lola: 64695720 markings, 290757746 edges, 430234 markings/sec, 145 secs
lola: 66534321 markings, 299949488 edges, 367720 markings/sec, 150 secs
lola: 68342849 markings, 308991388 edges, 361706 markings/sec, 155 secs
lola: 70128572 markings, 317919430 edges, 357145 markings/sec, 160 secs
lola: 71923774 markings, 326894950 edges, 359040 markings/sec, 165 secs
lola: 73632870 markings, 335440013 edges, 341819 markings/sec, 170 secs
lola: 75408259 markings, 344316564 edges, 355078 markings/sec, 175 secs
lola: 77199958 markings, 353274693 edges, 358340 markings/sec, 180 secs
lola: 78987217 markings, 362210644 edges, 357452 markings/sec, 185 secs
lola: 80794783 markings, 371248152 edges, 361513 markings/sec, 190 secs
lola: 82612279 markings, 380335323 edges, 363499 markings/sec, 195 secs
lola: 84303013 markings, 388788720 edges, 338147 markings/sec, 200 secs
lola: 86094774 markings, 397747246 edges, 358352 markings/sec, 205 secs
lola: 87884930 markings, 406697759 edges, 358031 markings/sec, 210 secs
lola: 89655063 markings, 415548174 edges, 354027 markings/sec, 215 secs
lola: 91447938 markings, 424512296 edges, 358575 markings/sec, 220 secs
lola: 93201110 markings, 433277922 edges, 350634 markings/sec, 225 secs
lola: 94997129 markings, 442257785 edges, 359204 markings/sec, 230 secs
lola: 96846040 markings, 451499190 edges, 369782 markings/sec, 235 secs
lola: 98734445 markings, 460937650 edges, 377681 markings/sec, 240 secs
lola: 100584596 markings, 470186225 edges, 370030 markings/sec, 245 secs
lola: 102439321 markings, 479458110 edges, 370945 markings/sec, 250 secs
lola: 104318223 markings, 488851111 edges, 375780 markings/sec, 255 secs
lola: 106151662 markings, 498017001 edges, 366688 markings/sec, 260 secs
lola: 108006323 markings, 507289103 edges, 370932 markings/sec, 265 secs
lola: 109849711 markings, 516504941 edges, 368678 markings/sec, 270 secs
lola: 111686735 markings, 525689031 edges, 367405 markings/sec, 275 secs
lola: 113553425 markings, 535021503 edges, 373338 markings/sec, 280 secs
lola: 114161424 markings, 538061185 edges, 121600 markings/sec, 285 secs
lola: 114162074 markings, 538064440 edges, 130 markings/sec, 290 secs
lola: 114162081 markings, 538064474 edges, 1 markings/sec, 295 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
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-N2000P0-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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-N2000P0"
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-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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-N2000P0, 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-152646359500178"
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 ;