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

About the Execution of M4M.full for ClientsAndServers-PT-N2000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15917.590 741935.00 685882.00 4504.40 FT?FFTTF??FFFFFF 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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265000051
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527409301723


BK_STOP 1527410043658

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N2000P0 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 667206, 'Memory': 15244.59, 'Tool': 'lola'}, {'Time': 3510197, 'Memory': 14030.67, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ClientsAndServers-PT-N2000P0...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N2000P0: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ ClientsAndServers-PT-N2000P0 @ 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-N2000P0-LTLCardinality.task
lola: A ((F ((2 <= SA)) U (3 <= CR))) : A ((StR <= SG)) : A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi)))) : A ((3 <= CA)) : A (F (F (F (G ((SwA <= Cb)))))) : A ((StR <= MpA)) : A ((CF <= CR)) : A (G ((SpG <= SpA))) : A (F (G (X (X ((1 <= Mi)))))) : A (F (G (X (F ((1 <= CwA)))))) : A ((G ((Cb <= CG)) U F (G ((MwU <= SG))))) : A (X (X (G (X ((Ci <= CG)))))) : A ((2 <= CwA)) : A ((Ci <= StR)) : A (G (X (G ((1 <= SpA))))) : A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((2 <= SA)) U (3 <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= SA)) U (3 <= CR)))
lola: processed formula: A ((F ((2 <= SA)) U (3 <= CR)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((StR <= SG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (StR <= SG)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: processed formula: A ((F (X ((MpG <= CwA))) U G ((MwU <= Mi))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2446506 markings, 5350638 edges, 489301 markings/sec, 0 secs
lola: 4677813 markings, 10673692 edges, 446261 markings/sec, 5 secs
lola: 6903833 markings, 16009110 edges, 445204 markings/sec, 10 secs
lola: 9022293 markings, 21123667 edges, 423692 markings/sec, 15 secs
lola: 11123423 markings, 26198653 edges, 420226 markings/sec, 20 secs
lola: 13178390 markings, 31238740 edges, 410993 markings/sec, 25 secs
lola: 15271971 markings, 36301450 edges, 418716 markings/sec, 30 secs
lola: 17329591 markings, 41291220 edges, 411524 markings/sec, 35 secs
lola: 19161408 markings, 45842313 edges, 366363 markings/sec, 40 secs
lola: 21221911 markings, 50811138 edges, 412101 markings/sec, 45 secs
lola: 23050414 markings, 55383145 edges, 365701 markings/sec, 50 secs
lola: 25128446 markings, 60387293 edges, 415606 markings/sec, 55 secs
lola: 27008631 markings, 65079666 edges, 376037 markings/sec, 60 secs
lola: 29052091 markings, 70046403 edges, 408692 markings/sec, 65 secs
lola: 30978700 markings, 74799255 edges, 385322 markings/sec, 70 secs
lola: 32741901 markings, 79243252 edges, 352640 markings/sec, 75 secs
lola: 34813447 markings, 84245434 edges, 414309 markings/sec, 80 secs
lola: 36699200 markings, 88904500 edges, 377151 markings/sec, 85 secs
lola: 38467039 markings, 93359723 edges, 353568 markings/sec, 90 secs
lola: 40474987 markings, 98212536 edges, 401590 markings/sec, 95 secs
lola: 42363640 markings, 102872369 edges, 377731 markings/sec, 100 secs
lola: 44119440 markings, 107281507 edges, 351160 markings/sec, 105 secs
lola: 45856587 markings, 111668904 edges, 347429 markings/sec, 110 secs
lola: 47890682 markings, 116555068 edges, 406819 markings/sec, 115 secs
lola: 49753740 markings, 121161032 edges, 372612 markings/sec, 120 secs
lola: 51501860 markings, 125558729 edges, 349624 markings/sec, 125 secs
lola: 53232708 markings, 129942238 edges, 346170 markings/sec, 130 secs
lola: 55259915 markings, 134814552 edges, 405441 markings/sec, 135 secs
lola: 57161992 markings, 139509147 edges, 380415 markings/sec, 140 secs
lola: 58898099 markings, 143861693 edges, 347221 markings/sec, 145 secs
lola: 60612968 markings, 148187264 edges, 342974 markings/sec, 150 secs
lola: 62293934 markings, 152463821 edges, 336193 markings/sec, 155 secs
lola: 64309260 markings, 157276363 edges, 403065 markings/sec, 160 secs
lola: 66177273 markings, 161901868 edges, 373603 markings/sec, 165 secs
lola: 67949532 markings, 166325686 edges, 354452 markings/sec, 170 secs
lola: 69643208 markings, 170602952 edges, 338735 markings/sec, 175 secs
lola: 71329298 markings, 174877005 edges, 337218 markings/sec, 180 secs
lola: 73055343 markings, 179172610 edges, 345209 markings/sec, 185 secs
lola: 75080255 markings, 184070589 edges, 404982 markings/sec, 190 secs
lola: 76918198 markings, 188617066 edges, 367589 markings/sec, 195 secs
lola: 78640326 markings, 192926716 edges, 344426 markings/sec, 200 secs
lola: 80331814 markings, 197197598 edges, 338298 markings/sec, 205 secs
lola: 81976061 markings, 201371854 edges, 328849 markings/sec, 210 secs
lola: 83640354 markings, 205605676 edges, 332859 markings/sec, 215 secs
lola: 85596367 markings, 210277871 edges, 391203 markings/sec, 220 secs
lola: 87438821 markings, 214868644 edges, 368491 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= CA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= CA)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (G ((SwA <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((SwA <= Cb))))
lola: processed formula: A (F (G ((SwA <= Cb))))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 72015 markings, 72016 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((StR <= MpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (StR <= MpA)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((CF <= CR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (CF <= CR)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SpG <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((1 <= Mi))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((1 <= Mi))))))
lola: processed formula: A (F (G (X (X ((1 <= Mi))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3438734 markings, 6253370 edges, 687747 markings/sec, 0 secs
lola: 6273235 markings, 12943968 edges, 566900 markings/sec, 5 secs
lola: 9062834 markings, 19174170 edges, 557920 markings/sec, 10 secs
lola: 11462703 markings, 24986894 edges, 479974 markings/sec, 15 secs
lola: 14019240 markings, 31038670 edges, 511307 markings/sec, 20 secs
lola: 17072705 markings, 38411595 edges, 610693 markings/sec, 25 secs
lola: 19732065 markings, 44706914 edges, 531872 markings/sec, 30 secs
lola: 22113941 markings, 50853634 edges, 476375 markings/sec, 35 secs
lola: 24712141 markings, 56887157 edges, 519640 markings/sec, 40 secs
lola: 26899493 markings, 62706766 edges, 437470 markings/sec, 45 secs
lola: 29616457 markings, 68546491 edges, 543393 markings/sec, 50 secs
lola: 31821963 markings, 74424794 edges, 441101 markings/sec, 55 secs
lola: 34258412 markings, 80846484 edges, 487290 markings/sec, 60 secs
lola: 36355816 markings, 86835974 edges, 419481 markings/sec, 65 secs
lola: 38669137 markings, 92803522 edges, 462664 markings/sec, 70 secs
lola: 40919505 markings, 98953827 edges, 450074 markings/sec, 75 secs
lola: 43086633 markings, 105413003 edges, 433426 markings/sec, 80 secs
lola: 45571015 markings, 111565621 edges, 496876 markings/sec, 85 secs
lola: 47622852 markings, 117253750 edges, 410367 markings/sec, 90 secs
lola: 50074787 markings, 122835089 edges, 490387 markings/sec, 95 secs
lola: 52179623 markings, 128228710 edges, 420967 markings/sec, 100 secs
lola: 54111923 markings, 133972550 edges, 386460 markings/sec, 105 secs
lola: 56218990 markings, 139295317 edges, 421413 markings/sec, 110 secs
lola: 58417460 markings, 145353544 edges, 439694 markings/sec, 115 secs
lola: 60377900 markings, 151061501 edges, 392088 markings/sec, 120 secs
lola: 62185253 markings, 157055361 edges, 361471 markings/sec, 125 secs
lola: 64189257 markings, 162601671 edges, 400801 markings/sec, 130 secs
lola: 65911774 markings, 168152039 edges, 344503 markings/sec, 135 secs
lola: 68335023 markings, 174035671 edges, 484650 markings/sec, 140 secs
lola: 70636256 markings, 180512754 edges, 460247 markings/sec, 145 secs
lola: 73074150 markings, 187411802 edges, 487579 markings/sec, 150 secs
lola: 75194282 markings, 192927363 edges, 424026 markings/sec, 155 secs
lola: 77044767 markings, 198214905 edges, 370097 markings/sec, 160 secs
lola: 79389328 markings, 204147060 edges, 468912 markings/sec, 165 secs
lola: 81373511 markings, 209722630 edges, 396837 markings/sec, 170 secs
lola: 83455443 markings, 215390955 edges, 416386 markings/sec, 175 secs
lola: 85419614 markings, 220999111 edges, 392834 markings/sec, 180 secs
lola: 87167513 markings, 226644730 edges, 349580 markings/sec, 185 secs
lola: 89684663 markings, 232254655 edges, 503430 markings/sec, 190 secs
lola: 91698265 markings, 238332016 edges, 402720 markings/sec, 195 secs
lola: 93803734 markings, 243927394 edges, 421094 markings/sec, 200 secs
lola: 96061693 markings, 249512945 edges, 451592 markings/sec, 205 secs
lola: 98296189 markings, 255653783 edges, 446899 markings/sec, 210 secs
lola: 100216824 markings, 261200598 edges, 384127 markings/sec, 215 secs
lola: 100216838 markings, 261200666 edges, 3 markings/sec, 220 secs
lola: 100217017 markings, 261201555 edges, 36 markings/sec, 225 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((1 <= CwA))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((1 <= CwA))))))
lola: processed formula: A (F (G (X (F ((1 <= CwA))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3065829 markings, 6746889 edges, 613166 markings/sec, 0 secs
lola: 5595460 markings, 12869183 edges, 505926 markings/sec, 5 secs
lola: 8337852 markings, 19774423 edges, 548478 markings/sec, 10 secs
lola: 10628357 markings, 25956123 edges, 458101 markings/sec, 15 secs
lola: 13045082 markings, 32062837 edges, 483345 markings/sec, 20 secs
lola: 15237951 markings, 38166079 edges, 438574 markings/sec, 25 secs
lola: 17153834 markings, 43874680 edges, 383177 markings/sec, 30 secs
lola: 19528032 markings, 50059148 edges, 474840 markings/sec, 35 secs
lola: 21562264 markings, 55715557 edges, 406846 markings/sec, 40 secs
lola: 23702624 markings, 61751928 edges, 428072 markings/sec, 45 secs
lola: 25659586 markings, 67705718 edges, 391392 markings/sec, 50 secs
lola: 27801977 markings, 73909856 edges, 428478 markings/sec, 55 secs
lola: 30151784 markings, 80545815 edges, 469961 markings/sec, 60 secs
lola: 32275010 markings, 86354364 edges, 424645 markings/sec, 65 secs
lola: 34244422 markings, 92200502 edges, 393882 markings/sec, 70 secs
lola: 36346840 markings, 98055446 edges, 420484 markings/sec, 75 secs
lola: 38537309 markings, 104134511 edges, 438094 markings/sec, 80 secs
lola: 40661579 markings, 110409944 edges, 424854 markings/sec, 85 secs
lola: 43031237 markings, 116530615 edges, 473932 markings/sec, 90 secs
lola: 45190816 markings, 122808476 edges, 431916 markings/sec, 95 secs
lola: 47078595 markings, 129047717 edges, 377556 markings/sec, 100 secs
lola: 49233357 markings, 135057091 edges, 430952 markings/sec, 105 secs
lola: 51194339 markings, 140821783 edges, 392196 markings/sec, 110 secs
lola: 53128047 markings, 146362406 edges, 386742 markings/sec, 115 secs
lola: 55010610 markings, 152227112 edges, 376513 markings/sec, 120 secs
lola: 56949401 markings, 158017463 edges, 387758 markings/sec, 125 secs
lola: 59160786 markings, 164077424 edges, 442277 markings/sec, 130 secs
lola: 61087944 markings, 169963926 edges, 385432 markings/sec, 135 secs
lola: 63047761 markings, 175547071 edges, 391963 markings/sec, 140 secs
lola: 65060213 markings, 181420409 edges, 402490 markings/sec, 145 secs
lola: 66828476 markings, 187197368 edges, 353653 markings/sec, 150 secs
lola: 68739752 markings, 193282888 edges, 382255 markings/sec, 155 secs
lola: 70647832 markings, 198916053 edges, 381616 markings/sec, 160 secs
lola: 72488854 markings, 204604269 edges, 368204 markings/sec, 165 secs
lola: 74500689 markings, 210664219 edges, 402367 markings/sec, 170 secs
lola: 76270785 markings, 216406965 edges, 354019 markings/sec, 175 secs
lola: 77760436 markings, 221712175 edges, 297930 markings/sec, 180 secs
lola: 79544862 markings, 227321116 edges, 356885 markings/sec, 185 secs
lola: 81755867 markings, 233553042 edges, 442201 markings/sec, 190 secs
lola: 83432844 markings, 238941961 edges, 335395 markings/sec, 195 secs
lola: 85147646 markings, 244144923 edges, 342960 markings/sec, 200 secs
lola: 86981121 markings, 250057884 edges, 366695 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: processed formula: A ((G ((Cb <= CG)) U F (G ((MwU <= SG)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 104669 markings, 136860 edges
lola: ========================================
lola: subprocess 11 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((Ci <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((Ci <= CG))))))
lola: processed formula: A (X (X (G (X ((Ci <= CG))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 12 will run for 711 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CwA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CwA)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 948 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Ci <= StR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= StR)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((1 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((1 <= SpA)))))
lola: processed formula: A (G (X (G ((1 <= SpA)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 100001 markings, 100001 edges
lola: ========================================
lola: subprocess 15 will run for 2845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: processed formula: A (F (G (((MpG <= SF) U (2 <= CF)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N2000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260000 markings, 292001 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no no yes yes no unknown unknown no no no no no no
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N2000P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265000051"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;