About the Execution of M4M.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.060 | 681063.00 | 497951.00 | 3120.70 | 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 mcc4mcc-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 r047-smll-152646363600187
=====================================================================
--------------------
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 1526574507546
BK_STOP 1526575188609
--------------------
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...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2.sara
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: 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 || 2212324 markings, 4527886 edges, 442465 markings/sec, 0 secs
lola: sara is running 5 secs || 3998437 markings, 8954692 edges, 357223 markings/sec, 5 secs
lola: sara is running 10 secs || 5745240 markings, 13306365 edges, 349361 markings/sec, 10 secs
lola: sara is running 15 secs || 7430851 markings, 17546350 edges, 337122 markings/sec, 15 secs
lola: sara is running 20 secs || 9086527 markings, 21710314 edges, 331135 markings/sec, 20 secs
lola: sara is running 25 secs || 10711706 markings, 25786965 edges, 325036 markings/sec, 25 secs
lola: sara is running 30 secs || 12285110 markings, 29804300 edges, 314681 markings/sec, 30 secs
lola: sara is running 35 secs || 13922088 markings, 33906048 edges, 327396 markings/sec, 35 secs
lola: sara is running 40 secs || 15601862 markings, 38112131 edges, 335955 markings/sec, 40 secs
lola: sara is running 45 secs || 17370324 markings, 42478424 edges, 353692 markings/sec, 45 secs
lola: sara is running 50 secs || 18936922 markings, 46486456 edges, 313320 markings/sec, 50 secs
lola: sara is running 55 secs || 20526159 markings, 50518252 edges, 317847 markings/sec, 55 secs
lola: sara is running 60 secs || 22117859 markings, 54549699 edges, 318340 markings/sec, 60 secs
lola: sara is running 65 secs || 23709038 markings, 58593981 edges, 318236 markings/sec, 65 secs
lola: sara is running 70 secs || 25241383 markings, 62532956 edges, 306469 markings/sec, 70 secs
lola: sara is running 75 secs || 26742217 markings, 66392511 edges, 300167 markings/sec, 75 secs
lola: sara is running 80 secs || 28289717 markings, 70309883 edges, 309500 markings/sec, 80 secs
lola: sara is running 85 secs || 29835835 markings, 74239668 edges, 309224 markings/sec, 85 secs
lola: sara is running 90 secs || 31269850 markings, 77952125 edges, 286803 markings/sec, 90 secs
lola: sara is running 95 secs || 32818901 markings, 81878253 edges, 309810 markings/sec, 95 secs
lola: sara is running 100 secs || 34315755 markings, 85724898 edges, 299371 markings/sec, 100 secs
lola: sara is running 105 secs || 35887127 markings, 89707132 edges, 314274 markings/sec, 105 secs
lola: sara is running 110 secs || 37325280 markings, 93423952 edges, 287631 markings/sec, 110 secs
lola: sara is running 115 secs || 38816430 markings, 97240301 edges, 298230 markings/sec, 115 secs
lola: sara is running 120 secs || 40356693 markings, 101141813 edges, 308053 markings/sec, 120 secs
lola: sara is running 125 secs || 41755025 markings, 104809647 edges, 279666 markings/sec, 125 secs
lola: sara is running 130 secs || 43248668 markings, 108630481 edges, 298729 markings/sec, 130 secs
lola: sara is running 135 secs || 44731920 markings, 112427696 edges, 296650 markings/sec, 135 secs
lola: sara is running 140 secs || 46175355 markings, 116149362 edges, 288687 markings/sec, 140 secs
lola: sara is running 145 secs || 47608331 markings, 119845679 edges, 286595 markings/sec, 145 secs
lola: sara is running 150 secs || 49092536 markings, 123597023 edges, 296841 markings/sec, 150 secs
lola: sara is running 155 secs || 50513056 markings, 127288306 edges, 284104 markings/sec, 155 secs
lola: sara is running 160 secs || 51948872 markings, 131001516 edges, 287163 markings/sec, 160 secs
lola: sara is running 165 secs || 53391927 markings, 134733211 edges, 288611 markings/sec, 165 secs
lola: sara is running 170 secs || 54848509 markings, 138454247 edges, 291316 markings/sec, 170 secs
lola: sara is running 175 secs || 56250840 markings, 142081946 edges, 280466 markings/sec, 175 secs
lola: sara is running 180 secs || 57608425 markings, 145646369 edges, 271517 markings/sec, 180 secs
lola: sara is running 185 secs || 58979763 markings, 149237718 edges, 274268 markings/sec, 185 secs
lola: sara is running 190 secs || 60391924 markings, 152889054 edges, 282432 markings/sec, 190 secs
lola: sara is running 195 secs || 61763762 markings, 156467640 edges, 274368 markings/sec, 195 secs
lola: sara is running 200 secs || 63166140 markings, 160096650 edges, 280476 markings/sec, 200 secs
lola: sara is running 205 secs || 64617152 markings, 163792820 edges, 290202 markings/sec, 205 secs
lola: sara is running 210 secs || 65995662 markings, 167403014 edges, 275702 markings/sec, 210 secs
lola: sara is running 215 secs || 67408497 markings, 171055222 edges, 282567 markings/sec, 215 secs
lola: sara is running 220 secs || 68836547 markings, 174732672 edges, 285610 markings/sec, 220 secs
lola: sara is running 225 secs || 70223181 markings, 178340110 edges, 277327 markings/sec, 225 secs
lola: sara is running 230 secs || 71640988 markings, 181973916 edges, 283561 markings/sec, 230 secs
lola: sara is running 235 secs || 72995614 markings, 185524754 edges, 270925 markings/sec, 235 secs
lola: sara is running 240 secs || 74328821 markings, 189027460 edges, 266641 markings/sec, 240 secs
lola: sara is running 245 secs || 75661661 markings, 192545891 edges, 266568 markings/sec, 245 secs
lola: sara is running 250 secs || 77030185 markings, 196097182 edges, 273705 markings/sec, 250 secs
lola: sara is running 255 secs || 78435224 markings, 199717540 edges, 281008 markings/sec, 255 secs
lola: sara is running 260 secs || 79876406 markings, 203399123 edges, 288236 markings/sec, 260 secs
lola: sara is running 265 secs || 81347538 markings, 207118312 edges, 294226 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 || 4110189 markings, 4671439 edges, 822038 markings/sec, 0 secs
lola: sara is running 5 secs || 7889031 markings, 8995548 edges, 755768 markings/sec, 5 secs
lola: sara is running 10 secs || 11589102 markings, 13168787 edges, 740014 markings/sec, 10 secs
lola: sara is running 15 secs || 15034935 markings, 17421219 edges, 689167 markings/sec, 15 secs
lola: sara is running 20 secs || 18536055 markings, 21505385 edges, 700224 markings/sec, 20 secs
lola: sara is running 25 secs || 21929297 markings, 25469600 edges, 678648 markings/sec, 25 secs
lola: sara is running 30 secs || 25421935 markings, 29525233 edges, 698528 markings/sec, 30 secs
lola: sara is running 35 secs || 28632773 markings, 33416121 edges, 642168 markings/sec, 35 secs
lola: sara is running 40 secs || 31926192 markings, 37426671 edges, 658684 markings/sec, 40 secs
lola: sara is running 45 secs || 35196762 markings, 41346045 edges, 654114 markings/sec, 45 secs
lola: sara is running 50 secs || 38546066 markings, 45308857 edges, 669861 markings/sec, 50 secs
lola: sara is running 55 secs || 41859218 markings, 49224433 edges, 662630 markings/sec, 55 secs
lola: sara is running 60 secs || 45231448 markings, 53116145 edges, 674446 markings/sec, 60 secs
lola: sara is running 65 secs || 48494233 markings, 56994108 edges, 652557 markings/sec, 65 secs
lola: sara is running 70 secs || 51624649 markings, 60709518 edges, 626083 markings/sec, 70 secs
lola: sara is running 75 secs || 54749793 markings, 64456085 edges, 625029 markings/sec, 75 secs
lola: sara is running 80 secs || 57884340 markings, 68383533 edges, 626909 markings/sec, 80 secs
lola: sara is running 85 secs || 61052249 markings, 72190740 edges, 633582 markings/sec, 85 secs
lola: sara is running 90 secs || 64200558 markings, 75937436 edges, 629662 markings/sec, 90 secs
lola: sara is running 95 secs || 67320964 markings, 79729879 edges, 624081 markings/sec, 95 secs
lola: sara is running 100 secs || 70431099 markings, 83416696 edges, 622027 markings/sec, 100 secs
lola: sara is running 105 secs || 73431493 markings, 87064306 edges, 600079 markings/sec, 105 secs
lola: sara is running 110 secs || 76567527 markings, 90765401 edges, 627207 markings/sec, 110 secs
lola: sara is running 115 secs || 79669225 markings, 94394428 edges, 620340 markings/sec, 115 secs
lola: sara is running 120 secs || 82784867 markings, 98098679 edges, 623128 markings/sec, 120 secs
lola: sara is running 125 secs || 85981804 markings, 101866601 edges, 639387 markings/sec, 125 secs
lola: sara is running 130 secs || 88885053 markings, 105429732 edges, 580650 markings/sec, 130 secs
lola: sara is running 135 secs || 91950884 markings, 109017787 edges, 613166 markings/sec, 135 secs
lola: sara is running 140 secs || 94916648 markings, 112531029 edges, 593153 markings/sec, 140 secs
lola: sara is running 145 secs || 97672175 markings, 116191226 edges, 551105 markings/sec, 145 secs
lola: sara is running 150 secs || 100643864 markings, 119703228 edges, 594338 markings/sec, 150 secs
lola: sara is running 155 secs || 103431808 markings, 123037350 edges, 557589 markings/sec, 155 secs
lola: sara is running 160 secs || 106357285 markings, 126492873 edges, 585095 markings/sec, 160 secs
lola: sara is running 165 secs || 109245571 markings, 129962047 edges, 577657 markings/sec, 165 secs
lola: sara is running 170 secs || 112050992 markings, 133343419 edges, 561084 markings/sec, 170 secs
lola: sara is running 175 secs || 114702414 markings, 136604086 edges, 530284 markings/sec, 175 secs
lola: sara is running 180 secs || 117625574 markings, 140082617 edges, 584632 markings/sec, 180 secs
lola: sara is running 185 secs || 120427887 markings, 143481561 edges, 560463 markings/sec, 185 secs
lola: sara is running 190 secs || 123107569 markings, 146664533 edges, 535936 markings/sec, 190 secs
lola: sara is running 195 secs || 126062145 markings, 150048038 edges, 590915 markings/sec, 195 secs
lola: sara is running 200 secs || 128664292 markings, 153410269 edges, 520429 markings/sec, 200 secs
lola: sara is running 205 secs || 128904563 markings, 153695025 edges, 48054 markings/sec, 205 secs
lola: sara is running 210 secs || 128912502 markings, 153702964 edges, 1588 markings/sec, 210 secs
lola: sara is running 215 secs || 128921351 markings, 153711927 edges, 1770 markings/sec, 215 secs
lola: sara is running 220 secs || 128921447 markings, 153712023 edges, 19 markings/sec, 220 secs
lola: sara is running 225 secs || 128923946 markings, 153714522 edges, 500 markings/sec, 225 secs
lola: sara is running 230 secs || 128931004 markings, 153721580 edges, 1412 markings/sec, 230 secs
lola: sara is running 235 secs || 128931029 markings, 153721605 edges, 5 markings/sec, 235 secs
lola: sara is running 240 secs || 128931051 markings, 153721627 edges, 4 markings/sec, 240 secs
lola: sara is running 245 secs || 128931072 markings, 153721648 edges, 4 markings/sec, 245 secs
lola: sara is running 250 secs || 128931087 markings, 153721663 edges, 3 markings/sec, 250 secs
lola: sara is running 255 secs || 128931108 markings, 153721684 edges, 4 markings/sec, 255 secs
lola: sara is running 260 secs || 128931127 markings, 153721702 edges, 4 markings/sec, 260 secs
lola: sara is running 265 secs || 128931145 markings, 153721721 edges, 4 markings/sec, 265 secs
lola: sara is running 270 secs || 128931158 markings, 153721734 edges, 3 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1452 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: ========================================
lola: subprocess 15 will run for 2904 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="mcc4mcc-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 mcc4mcc-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 r047-smll-152646363600187"
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 ;