About the Execution of Irma.struct for ClientsAndServers-PT-N5000P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.010 | 536517.00 | 505534.00 | 3024.50 | TFF?FTFTTTFFT?TT | 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 172K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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-N5000P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359500187
=====================================================================
--------------------
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-N5000P0-ReachabilityCardinality-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526482496715
BK_STOP 1526483033232
--------------------
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-N5000P0 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 2985, 'Memory': 254.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola ClientsAndServers-PT-N5000P0...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ ClientsAndServers-PT-N5000P0 @ 3540 seconds
----- Start make result stdout -----
----- 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-N5000P0-ReachabilityCardinality.task
lola: E (F ((((2 <= SA) AND (Uf <= 1)) OR ((SG <= Uf) AND (2 <= MwU) AND (2 <= MpA))))) : A (G ((SpA <= Ci))) : A (G ((CF <= 2))) : A (G ((MpA + 1 <= Mi))) : A (G (((((1 <= StR) OR (3 <= CwA)) AND ((SF <= Cb) OR (SpG <= Ci))) OR (SF <= Si)))) : E (F ((Ci <= StF))) : A (G (((SF <= SwG) OR (3 <= StF) OR ((CA <= StF) AND (Cb <= SpG)) OR (SpA <= CR)))) : A (G (((MpG <= CwG) OR (Uf + 1 <= Si)))) : E (F (((Si + 1 <= CF) AND (StF <= 0) AND (CG <= SG)))) : E (F (((1 <= Mi) AND (3 <= MwU) AND (CG <= StF) AND (2 <= SwA)))) : E (F (((MpA + 1 <= Uf) AND (Mi <= 1) AND (CwG + 1 <= SpG) AND (MwU <= 0)))) : E (F ((Mi <= 0))) : E (F (((SG + 1 <= MtF) AND (CR + 1 <= SA) AND (Uf + 1 <= Cb)))) : A (G (((MwU <= Mi) OR (1 <= Cb) OR (SwG + 1 <= Uf) OR ((StF <= SwA) AND (3 <= SwG)) OR (SF + 1 <= CG)))) : E (F ((3 <= SpA))) : A (G (((SG <= SwG) OR (StR <= SG) OR ((CR <= SwG) AND (SR <= SpG)) OR (1 <= CG))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= SA) AND (Uf <= 1)) OR ((SG <= Uf) AND (2 <= MwU) AND (2 <= MpA)))))
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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 560304 markings, 560422 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SpA <= Ci)))
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-N5000P0-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40016 markings, 40015 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CF <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((MpA + 1 <= Mi)))
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-N5000P0-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 2323104 markings, 4797890 edges, 464621 markings/sec, 0 secs
lola: sara is running 5 secs || 4080694 markings, 9161220 edges, 351518 markings/sec, 5 secs
lola: sara is running 10 secs || 5822056 markings, 13493083 edges, 348272 markings/sec, 10 secs
lola: sara is running 15 secs || 7473148 markings, 17655967 edges, 330218 markings/sec, 15 secs
lola: sara is running 20 secs || 9097895 markings, 21741035 edges, 324949 markings/sec, 20 secs
lola: sara is running 25 secs || 10469489 markings, 25191817 edges, 274319 markings/sec, 25 secs
lola: sara is running 30 secs || 12003424 markings, 29084765 edges, 306787 markings/sec, 30 secs
lola: sara is running 35 secs || 13577953 markings, 33048161 edges, 314906 markings/sec, 35 secs
lola: sara is running 40 secs || 15237989 markings, 37190816 edges, 332007 markings/sec, 40 secs
lola: sara is running 45 secs || 16922201 markings, 41373820 edges, 336842 markings/sec, 45 secs
lola: sara is running 50 secs || 18429700 markings, 45187414 edges, 301500 markings/sec, 50 secs
lola: sara is running 55 secs || 19889049 markings, 48923982 edges, 291870 markings/sec, 55 secs
lola: sara is running 60 secs || 21421071 markings, 52786447 edges, 306404 markings/sec, 60 secs
lola: sara is running 65 secs || 22976896 markings, 56720136 edges, 311165 markings/sec, 65 secs
lola: sara is running 70 secs || 24484006 markings, 60584055 edges, 301422 markings/sec, 70 secs
lola: sara is running 75 secs || 25977133 markings, 64417739 edges, 298625 markings/sec, 75 secs
lola: sara is running 80 secs || 27442664 markings, 68159895 edges, 293106 markings/sec, 80 secs
lola: sara is running 85 secs || 28921058 markings, 71914133 edges, 295679 markings/sec, 85 secs
lola: sara is running 90 secs || 30413360 markings, 75721955 edges, 298460 markings/sec, 90 secs
lola: sara is running 95 secs || 31871933 markings, 79467091 edges, 291715 markings/sec, 95 secs
lola: sara is running 100 secs || 33383396 markings, 83329281 edges, 302293 markings/sec, 100 secs
lola: sara is running 105 secs || 34773151 markings, 86881792 edges, 277951 markings/sec, 105 secs
lola: sara is running 110 secs || 36211181 markings, 90503842 edges, 287606 markings/sec, 110 secs
lola: sara is running 115 secs || 37501218 markings, 93872529 edges, 258007 markings/sec, 115 secs
lola: sara is running 120 secs || 38905154 markings, 97458933 edges, 280787 markings/sec, 120 secs
lola: sara is running 125 secs || 40327093 markings, 101070527 edges, 284388 markings/sec, 125 secs
lola: sara is running 130 secs || 41626327 markings, 104458919 edges, 259847 markings/sec, 130 secs
lola: sara is running 135 secs || 43020644 markings, 108031839 edges, 278863 markings/sec, 135 secs
lola: sara is running 140 secs || 44380347 markings, 111535193 edges, 271941 markings/sec, 140 secs
lola: sara is running 145 secs || 45750244 markings, 115059145 edges, 273979 markings/sec, 145 secs
lola: sara is running 150 secs || 47098510 markings, 118525543 edges, 269653 markings/sec, 150 secs
lola: sara is running 155 secs || 48494749 markings, 122052735 edges, 279248 markings/sec, 155 secs
lola: sara is running 160 secs || 49809020 markings, 125475257 edges, 262854 markings/sec, 160 secs
lola: sara is running 165 secs || 51150779 markings, 128966120 edges, 268352 markings/sec, 165 secs
lola: sara is running 170 secs || 52523629 markings, 132485833 edges, 274570 markings/sec, 170 secs
lola: sara is running 175 secs || 53924340 markings, 136075855 edges, 280142 markings/sec, 175 secs
lola: sara is running 180 secs || 55296912 markings, 139596420 edges, 274514 markings/sec, 180 secs
lola: sara is running 185 secs || 56608183 markings, 143014877 edges, 262254 markings/sec, 185 secs
lola: sara is running 190 secs || 57892417 markings, 146369915 edges, 256847 markings/sec, 190 secs
lola: sara is running 195 secs || 59193831 markings, 149769612 edges, 260283 markings/sec, 195 secs
lola: sara is running 200 secs || 60515734 markings, 153196585 edges, 264381 markings/sec, 200 secs
lola: sara is running 205 secs || 61815273 markings, 156584632 edges, 259908 markings/sec, 205 secs
lola: sara is running 210 secs || 63151323 markings, 160061327 edges, 267210 markings/sec, 210 secs
lola: sara is running 215 secs || 64569538 markings, 163662289 edges, 283643 markings/sec, 215 secs
lola: sara is running 220 secs || 65917794 markings, 167185453 edges, 269651 markings/sec, 220 secs
lola: sara is running 225 secs || 67293875 markings, 170754513 edges, 275216 markings/sec, 225 secs
lola: sara is running 230 secs || 68728224 markings, 174433229 edges, 286870 markings/sec, 230 secs
lola: sara is running 235 secs || 70047610 markings, 177892143 edges, 263877 markings/sec, 235 secs
lola: sara is running 240 secs || 71474739 markings, 181538039 edges, 285426 markings/sec, 240 secs
lola: sara is running 245 secs || 72810245 markings, 185042549 edges, 267101 markings/sec, 245 secs
lola: sara is running 250 secs || 74106873 markings, 188459488 edges, 259326 markings/sec, 250 secs
lola: sara is running 255 secs || 75428850 markings, 191937879 edges, 264395 markings/sec, 255 secs
lola: sara is running 260 secs || 76795879 markings, 195472743 edges, 273406 markings/sec, 260 secs
lola: sara is running 265 secs || 78199824 markings, 199100843 edges, 280789 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= StR) OR (3 <= CwA)) AND ((SF <= Cb) OR (SpG <= Ci))) OR (SF <= 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: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 270017 markings, 310023 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Ci <= StF)))
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: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40001 markings, 40000 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SF <= SwG) OR (3 <= StF) OR ((CA <= StF) AND (Cb <= SpG)) OR (SpA <= CR))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6.sara.
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MpG <= CwG) OR (Uf + 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Si + 1 <= CF) AND (StF <= 0) AND (CG <= SG))))
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-N5000P0-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20011 markings, 20010 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= Mi) AND (3 <= MwU) AND (CG <= StF) AND (2 <= SwA))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((MpA + 1 <= Uf) AND (Mi <= 1) AND (CwG + 1 <= SpG) AND (MwU <= 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Mi <= 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SG + 1 <= MtF) AND (CR + 1 <= SA) AND (Uf + 1 <= Cb))))
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-N5000P0-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 180036 markings, 180035 edges
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MwU <= Mi) OR (1 <= Cb) OR (SwG + 1 <= Uf) OR ((StF <= SwA) AND (3 <= SwG)) OR (SF + 1 <= CG))))
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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 4217287 markings, 4785156 edges, 843457 markings/sec, 0 secs
lola: sara is running 5 secs || 7817027 markings, 8908998 edges, 719948 markings/sec, 5 secs
lola: sara is running 10 secs || 11263442 markings, 12796164 edges, 689283 markings/sec, 10 secs
lola: sara is running 15 secs || 14546226 markings, 16700023 edges, 656557 markings/sec, 15 secs
lola: sara is running 20 secs || 17829111 markings, 20679802 edges, 656577 markings/sec, 20 secs
lola: sara is running 25 secs || 20731290 markings, 24111774 edges, 580436 markings/sec, 25 secs
lola: sara is running 30 secs || 24141450 markings, 28036816 edges, 682032 markings/sec, 30 secs
lola: sara is running 35 secs || 27279165 markings, 31779913 edges, 627543 markings/sec, 35 secs
lola: sara is running 40 secs || 30402617 markings, 35658731 edges, 624690 markings/sec, 40 secs
lola: sara is running 45 secs || 33468758 markings, 39324236 edges, 613228 markings/sec, 45 secs
lola: sara is running 50 secs || 36576183 markings, 43002753 edges, 621485 markings/sec, 50 secs
lola: sara is running 55 secs || 39824164 markings, 46800034 edges, 649596 markings/sec, 55 secs
lola: sara is running 60 secs || 43024965 markings, 50515446 edges, 640160 markings/sec, 60 secs
lola: sara is running 65 secs || 46092970 markings, 54129806 edges, 613601 markings/sec, 65 secs
lola: sara is running 70 secs || 49219023 markings, 57860144 edges, 625211 markings/sec, 70 secs
lola: sara is running 75 secs || 52158735 markings, 61340419 edges, 587942 markings/sec, 75 secs
lola: sara is running 80 secs || 55112300 markings, 64892293 edges, 590713 markings/sec, 80 secs
lola: sara is running 85 secs || 58106456 markings, 68639825 edges, 598831 markings/sec, 85 secs
lola: sara is running 90 secs || 61063575 markings, 72206596 edges, 591424 markings/sec, 90 secs
lola: sara is running 95 secs || 64027940 markings, 75721187 edges, 592873 markings/sec, 95 secs
lola: sara is running 100 secs || 66938089 markings, 79253521 edges, 582030 markings/sec, 100 secs
lola: sara is running 105 secs || 69810702 markings, 82685416 edges, 574523 markings/sec, 105 secs
lola: sara is running 110 secs || 72696503 markings, 86113664 edges, 577160 markings/sec, 110 secs
lola: sara is running 115 secs || 75501104 markings, 89552069 edges, 560920 markings/sec, 115 secs
lola: sara is running 120 secs || 78478624 markings, 93009421 edges, 595504 markings/sec, 120 secs
lola: sara is running 125 secs || 81413829 markings, 96457909 edges, 587041 markings/sec, 125 secs
lola: sara is running 130 secs || 84423518 markings, 100034934 edges, 601938 markings/sec, 130 secs
lola: sara is running 135 secs || 87376909 markings, 103536395 edges, 590678 markings/sec, 135 secs
lola: sara is running 140 secs || 90142881 markings, 106862833 edges, 553194 markings/sec, 140 secs
lola: sara is running 145 secs || 93099014 markings, 110342549 edges, 591227 markings/sec, 145 secs
lola: sara is running 150 secs || 95743421 markings, 113669636 edges, 528881 markings/sec, 150 secs
lola: sara is running 155 secs || 98476121 markings, 117214618 edges, 546540 markings/sec, 155 secs
lola: sara is running 160 secs || 101477869 markings, 120687976 edges, 600350 markings/sec, 160 secs
lola: sara is running 165 secs || 104215702 markings, 123935030 edges, 547567 markings/sec, 165 secs
lola: sara is running 170 secs || 107033247 markings, 127305365 edges, 563509 markings/sec, 170 secs
lola: sara is running 175 secs || 109807958 markings, 130665601 edges, 554942 markings/sec, 175 secs
lola: sara is running 180 secs || 112603416 markings, 134030030 edges, 559092 markings/sec, 180 secs
lola: sara is running 185 secs || 115187998 markings, 137165656 edges, 516916 markings/sec, 185 secs
lola: sara is running 190 secs || 118001255 markings, 140532533 edges, 562651 markings/sec, 190 secs
lola: sara is running 195 secs || 120775777 markings, 143870736 edges, 554904 markings/sec, 195 secs
lola: sara is running 200 secs || 123596838 markings, 147212539 edges, 564212 markings/sec, 200 secs
lola: sara is running 205 secs || 126377690 markings, 150552131 edges, 556170 markings/sec, 205 secs
lola: sara is running 210 secs || 128899234 markings, 153689696 edges, 504309 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= SpA)))
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: 49 markings, 48 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-14.sara
lola: ========================================
lola: subprocess 15 will run for 3050 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SG <= SwG) OR (StR <= SG) OR ((CR <= SwG) AND (SR <= SpG)) OR (1 <= CG))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown no yes no yes yes yes no no yes unknown yes yes
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
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-N5000P0"
export BK_EXAMINATION="ReachabilityCardinality"
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-N5000P0.tgz
mv ClientsAndServers-PT-N5000P0 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-N5000P0, examination is ReachabilityCardinality"
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-152646359500187"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;