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

About the Execution of Irma.full for DLCshifumi-PT-4b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4031.650 836782.00 1671002.00 3036.20 ???????????????? 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 5.3M
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 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 9.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 5.1M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCshifumi-PT-4b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-smll-152649737200194
=====================================================================


--------------------
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 DLCshifumi-PT-4b-ReachabilityCardinality-00
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-01
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-02
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-03
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-04
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-05
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-06
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-07
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-08
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-09
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-4b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526657627871


BK_STOP 1526658464653

--------------------
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 DLCshifumi-PT-4b as instance name.
Using DLCshifumi 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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 811486, 'Memory': 749.93, 'Tool': 'lola'}, {'Time': 840970, 'Memory': 759.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola DLCshifumi-PT-4b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DLCshifumi-PT-4b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ DLCshifumi-PT-4b @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 36356/65536 symbol table entries, 13849 collisions
lola: preprocessing...
lola: finding significant places
lola: 15015 places, 21341 transitions, 14324 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28617 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-4b-ReachabilityCardinality.task
lola: A (G (((p10732 <= p11595) AND (p12555 <= 2)))) : A (G ((p8272 <= p1607))) : A (G ((((2 <= p8647) AND (p11817 + 1 <= p11688)) OR (p9283 <= p13229)))) : E (F (((1 <= p3899) OR ((p1175 <= p14968) AND (2 <= p581)) OR (2 <= p14251)))) : A (G (((3 <= p6125) OR (p14679 <= p1945) OR (3 <= p7605) OR (p10887 <= p2969) OR ((p10086 <= p11975) AND (p12984 <= p2215) AND (p10759 <= 2))))) : E (F ((((p8629 <= p5582) OR (2 <= p11713)) AND ((3 <= p11355) OR (p10964 <= p13923)) AND (2 <= p7491) AND (2 <= p11157) AND (p14564 <= p10393)))) : A (G ((((3 <= p11505) AND (2 <= p9695)) OR ((p5527 <= 2) AND ((p9575 <= p5311) OR (p2391 <= p749)))))) : E (F ((3 <= p9350))) : A (G ((p3271 <= p4133))) : A (G ((((p5438 <= p2020) AND (3 <= p10772)) OR (p1235 <= p3230) OR (p11789 <= p9292) OR (2 <= p14807) OR ((3 <= p2616) AND (p2581 <= p10197))))) : E (F (((p9164 <= 1) AND (p14689 + 1 <= p10443) AND ((p8705 + 1 <= p5098) OR ((2 <= p446) AND (p4101 <= p14925)))))) : A (G (((2 <= p3735) OR (p1478 <= p7020)))) : A (G ((p6549 <= p7230))) : E (F (((p13327 + 1 <= p12347) OR ((1 <= p697) AND (3 <= p6179) AND (p419 + 1 <= p14717))))) : A (G ((p4026 <= p5814))) : A (G ((((p632 <= 1) OR (p8587 <= 0)) AND ((p3132 + 1 <= p7526) OR (p2663 <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p10732 <= p11595) AND (p12555 <= 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 1792 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 508 markings, 507 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p8272 <= p1607)))
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 1792 bytes per marking, with 12 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 DLCshifumi-PT-4b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= p8647) AND (p11817 + 1 <= p11688)) OR (p9283 <= p13229))))
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 1792 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6033 markings, 6652 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p3899) OR ((p1175 <= p14968) AND (2 <= p581)) OR (2 <= p14251))))
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 1792 bytes per marking, with 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1908 markings, 2126 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p6125) OR (p14679 <= p1945) OR (3 <= p7605) OR (p10887 <= p2969) OR ((p10086 <= p11975) AND (p12984 <= p2215) AND (p10759 <= 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 1792 bytes per marking, with 12 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 15 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 16564 markings, 18233 edges, 3313 markings/sec, 0 secs
lola: sara is running 5 secs || 33514 markings, 36901 edges, 3390 markings/sec, 5 secs
lola: sara is running 10 secs || 50631 markings, 55755 edges, 3423 markings/sec, 10 secs
lola: sara is running 15 secs || 63554 markings, 70047 edges, 2585 markings/sec, 15 secs
lola: sara is running 20 secs || 72509 markings, 80020 edges, 1791 markings/sec, 20 secs
lola: sara is running 25 secs || 81859 markings, 90481 edges, 1870 markings/sec, 25 secs
lola: sara is running 30 secs || 92458 markings, 102218 edges, 2120 markings/sec, 30 secs
lola: sara is running 35 secs || 101459 markings, 112248 edges, 1800 markings/sec, 35 secs
lola: sara is running 40 secs || 111182 markings, 123148 edges, 1945 markings/sec, 40 secs
lola: sara is running 45 secs || 120893 markings, 134072 edges, 1942 markings/sec, 45 secs
lola: sara is running 50 secs || 131391 markings, 145956 edges, 2100 markings/sec, 50 secs
lola: sara is running 55 secs || 141641 markings, 157481 edges, 2050 markings/sec, 55 secs
lola: sara is running 60 secs || 152020 markings, 169169 edges, 2076 markings/sec, 60 secs
lola: sara is running 65 secs || 161758 markings, 180065 edges, 1948 markings/sec, 65 secs
lola: sara is running 70 secs || 171098 markings, 190549 edges, 1868 markings/sec, 70 secs
lola: sara is running 75 secs || 181857 markings, 202701 edges, 2152 markings/sec, 75 secs
lola: sara is running 80 secs || 191920 markings, 214030 edges, 2013 markings/sec, 80 secs
lola: sara is running 85 secs || 202449 markings, 225900 edges, 2106 markings/sec, 85 secs
lola: sara is running 90 secs || 211737 markings, 236332 edges, 1858 markings/sec, 90 secs
lola: sara is running 95 secs || 221998 markings, 247815 edges, 2052 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 231666 markings, 258693 edges, 1934 markings/sec, 100 secs
lola: sara is running 105 secs || 242057 markings, 270451 edges, 2078 markings/sec, 105 secs
lola: sara is running 110 secs || 252750 markings, 282490 edges, 2139 markings/sec, 110 secs
lola: sara is running 115 secs || 262003 markings, 292875 edges, 1851 markings/sec, 115 secs
lola: sara is running 120 secs || 272039 markings, 304130 edges, 2007 markings/sec, 120 secs
lola: sara is running 125 secs || 281247 markings, 314448 edges, 1842 markings/sec, 125 secs
lola: sara is running 130 secs || 291766 markings, 326326 edges, 2104 markings/sec, 130 secs
lola: sara is running 135 secs || 301935 markings, 337769 edges, 2034 markings/sec, 135 secs
lola: sara is running 140 secs || 312170 markings, 349320 edges, 2047 markings/sec, 140 secs
lola: sara is running 145 secs || 321324 markings, 359598 edges, 1831 markings/sec, 145 secs
lola: sara is running 150 secs || 331426 markings, 370938 edges, 2020 markings/sec, 150 secs
lola: sara is running 155 secs || 341094 markings, 381801 edges, 1934 markings/sec, 155 secs
lola: sara is running 160 secs || 351035 markings, 393046 edges, 1988 markings/sec, 160 secs
lola: sara is running 165 secs || 361229 markings, 404522 edges, 2039 markings/sec, 165 secs
lola: sara is running 170 secs || 370598 markings, 415043 edges, 1874 markings/sec, 170 secs
lola: sara is running 175 secs || 379631 markings, 425163 edges, 1807 markings/sec, 175 secs
lola: sara is running 180 secs || 387901 markings, 434465 edges, 1654 markings/sec, 180 secs
lola: sara is running 185 secs || 397884 markings, 445759 edges, 1997 markings/sec, 185 secs
lola: sara is running 190 secs || 408030 markings, 457161 edges, 2029 markings/sec, 190 secs
lola: sara is running 195 secs || 418208 markings, 468637 edges, 2036 markings/sec, 195 secs
lola: sara is running 200 secs || 427898 markings, 479525 edges, 1938 markings/sec, 200 secs
lola: sara is running 205 secs || 437818 markings, 490601 edges, 1984 markings/sec, 205 secs
lola: sara is running 210 secs || 447485 markings, 501476 edges, 1933 markings/sec, 210 secs
lola: sara is running 215 secs || 457711 markings, 513044 edges, 2045 markings/sec, 215 secs
lola: sara is running 220 secs || 468000 markings, 524626 edges, 2058 markings/sec, 220 secs
lola: sara is running 225 secs || 478110 markings, 536005 edges, 2022 markings/sec, 225 secs
lola: sara is running 230 secs || 487888 markings, 546957 edges, 1956 markings/sec, 230 secs
lola: sara is running 235 secs || 497013 markings, 557204 edges, 1825 markings/sec, 235 secs
lola: sara is running 240 secs || 507260 markings, 568790 edges, 2049 markings/sec, 240 secs
lola: sara is running 245 secs || 517090 markings, 579847 edges, 1966 markings/sec, 245 secs
lola: sara is running 250 secs || 526996 markings, 591016 edges, 1981 markings/sec, 250 secs
lola: sara is running 255 secs || 536390 markings, 601556 edges, 1879 markings/sec, 255 secs
lola: sara is running 260 secs || 546409 markings, 612767 edges, 2004 markings/sec, 260 secs
lola: sara is running 265 secs || 556071 markings, 623638 edges, 1932 markings/sec, 265 secs
lola: sara is running 270 secs || 566112 markings, 634994 edges, 2008 markings/sec, 270 secs
lola: sara is running 275 secs || 576452 markings, 646644 edges, 2068 markings/sec, 275 secs
lola: sara is running 280 secs || 586771 markings, 658246 edges, 2064 markings/sec, 280 secs
lola: sara is running 285 secs || 596814 markings, 669498 edges, 2009 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p8629 <= p5582) OR (2 <= p11713)) AND ((3 <= p11355) OR (p10964 <= p13923)) AND (2 <= p7491) AND (2 <= p11157) AND (p14564 <= p10393))))
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 1792 bytes per marking, with 12 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 13479 markings, 15189 edges, 2696 markings/sec, 0 secs
lola: sara is running 5 secs || 25695 markings, 29066 edges, 2443 markings/sec, 5 secs
lola: sara is running 10 secs || 37767 markings, 42835 edges, 2414 markings/sec, 10 secs
lola: sara is running 15 secs || 49509 markings, 56258 edges, 2348 markings/sec, 15 secs
lola: sara is running 20 secs || 59698 markings, 67887 edges, 2038 markings/sec, 20 secs
lola: sara is running 25 secs || 71273 markings, 81122 edges, 2315 markings/sec, 25 secs
lola: sara is running 30 secs || 82541 markings, 94002 edges, 2254 markings/sec, 30 secs
lola: sara is running 35 secs || 94146 markings, 107269 edges, 2321 markings/sec, 35 secs
lola: sara is running 40 secs || 105690 markings, 120468 edges, 2309 markings/sec, 40 secs
lola: sara is running 45 secs || 117725 markings, 134228 edges, 2407 markings/sec, 45 secs
lola: sara is running 50 secs || 129113 markings, 147244 edges, 2278 markings/sec, 50 secs
lola: sara is running 55 secs || 141487 markings, 161402 edges, 2475 markings/sec, 55 secs
lola: sara is running 60 secs || 154019 markings, 175773 edges, 2506 markings/sec, 60 secs
lola: sara is running 65 secs || 167305 markings, 191001 edges, 2657 markings/sec, 65 secs
lola: sara is running 70 secs || 179197 markings, 204610 edges, 2378 markings/sec, 70 secs
lola: sara is running 75 secs || 192262 markings, 219551 edges, 2613 markings/sec, 75 secs
lola: sara is running 80 secs || 204265 markings, 233278 edges, 2401 markings/sec, 80 secs
lola: sara is running 85 secs || 215379 markings, 246004 edges, 2223 markings/sec, 85 secs
lola: sara is running 90 secs || 227760 markings, 260160 edges, 2476 markings/sec, 90 secs
lola: sara is running 95 secs || 240901 markings, 275183 edges, 2628 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 252598 markings, 288502 edges, 2339 markings/sec, 100 secs
lola: sara is running 105 secs || 264288 markings, 301811 edges, 2338 markings/sec, 105 secs
lola: sara is running 110 secs || 276422 markings, 315639 edges, 2427 markings/sec, 110 secs
lola: sara is running 115 secs || 291104 markings, 332476 edges, 2936 markings/sec, 115 secs
lola: sara is running 120 secs || 303809 markings, 347034 edges, 2541 markings/sec, 120 secs
lola: sara is running 125 secs || 316391 markings, 361424 edges, 2516 markings/sec, 125 secs
lola: sara is running 130 secs || 328509 markings, 375269 edges, 2424 markings/sec, 130 secs
lola: sara is running 135 secs || 342015 markings, 390734 edges, 2701 markings/sec, 135 secs
lola: sara is running 140 secs || 353773 markings, 404184 edges, 2352 markings/sec, 140 secs
lola: sara is running 145 secs || 366393 markings, 418618 edges, 2524 markings/sec, 145 secs
lola: sara is running 150 secs || 376592 markings, 430232 edges, 2040 markings/sec, 150 secs
lola: sara is running 155 secs || 388264 markings, 443525 edges, 2334 markings/sec, 155 secs
lola: sara is running 160 secs || 399781 markings, 456640 edges, 2303 markings/sec, 160 secs
lola: sara is running 165 secs || 411972 markings, 470584 edges, 2438 markings/sec, 165 secs
lola: sara is running 170 secs || 424726 markings, 485169 edges, 2551 markings/sec, 170 secs
lola: sara is running 175 secs || 434833 markings, 496705 edges, 2021 markings/sec, 175 secs
lola: sara is running 180 secs || 446088 markings, 509555 edges, 2251 markings/sec, 180 secs
lola: sara is running 185 secs || 459384 markings, 524797 edges, 2659 markings/sec, 185 secs
lola: sara is running 190 secs || 472238 markings, 539527 edges, 2571 markings/sec, 190 secs
lola: sara is running 195 secs || 483914 markings, 552853 edges, 2335 markings/sec, 195 secs
lola: sara is running 200 secs || 497130 markings, 567992 edges, 2643 markings/sec, 200 secs
lola: sara is running 205 secs || 510037 markings, 582797 edges, 2581 markings/sec, 205 secs

lola: sara is running 210 secs || 521492 markings, 595869 edges, 2291 markings/sec, 210 secs
lola: sara is running 215 secs || 534059 markings, 610262 edges, 2513 markings/sec, 215 secs
lola: sara is running 220 secs || 547164 markings, 625298 edges, 2621 markings/sec, 220 secs
lola: sara is running 225 secs || 558358 markings, 638067 edges, 2239 markings/sec, 225 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p11505) AND (2 <= p9695)) OR ((p5527 <= 2) AND ((p9575 <= p5311) OR (p2391 <= p749))))))
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 1792 bytes per marking, with 12 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-4b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-4b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 7225 markings, 9207 edges, 1445 markings/sec, 0 secs
lola: sara is running 5 secs || 13728 markings, 17613 edges, 1301 markings/sec, 5 secs
lola: sara is running 10 secs || 19713 markings, 25526 edges, 1197 markings/sec, 10 secs
lola: sara is running 15 secs || 25590 markings, 33443 edges, 1175 markings/sec, 15 secs
lola: sara is running 20 secs || 31088 markings, 40836 edges, 1100 markings/sec, 20 secs
lola: sara is running 25 secs || 36730 markings, 48192 edges, 1128 markings/sec, 25 secs
lola: sara is running 30 secs || 42575 markings, 55751 edges, 1169 markings/sec, 30 secs
lola: sara is running 35 secs || 50019 markings, 65310 edges, 1489 markings/sec, 35 secs
lola: sara is running 40 secs || 57224 markings, 74573 edges, 1441 markings/sec, 40 secs
lola: sara is running 45 secs || 64398 markings, 83727 edges, 1435 markings/sec, 45 secs
lola: sara is running 50 secs || 71692 markings, 93059 edges, 1459 markings/sec, 50 secs
lola: sara is running 55 secs || 78892 markings, 102302 edges, 1440 markings/sec, 55 secs
lola: sara is running 60 secs || 85947 markings, 111352 edges, 1411 markings/sec, 60 secs
lola: sara is running 65 secs || 92623 markings, 119828 edges, 1335 markings/sec, 65 secs
lola: sara is running 70 secs || 99727 markings, 128938 edges, 1421 markings/sec, 70 secs
lola: sara is running 75 secs || 106782 markings, 138017 edges, 1411 markings/sec, 75 secs
lola: sara is running 80 secs || 113992 markings, 147233 edges, 1442 markings/sec, 80 secs
lola: sara is running 85 secs || 121514 markings, 156857 edges, 1504 markings/sec, 85 secs
lola: sara is running 90 secs || 129112 markings, 166581 edges, 1520 markings/sec, 90 secs
lola: sara is running 95 secs || 136620 markings, 176222 edges, 1502 markings/sec, 95 secs
lola: sara is running 100 secs || 144203 markings, 185913 edges, 1517 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 105 secs || 151696 markings, 195546 edges, 1499 markings/sec, 105 secs
lola: sara is running 110 secs || 159003 markings, 204831 edges, 1461 markings/sec, 110 secs
lola: sara is running 115 secs || 165603 markings, 213294 edges, 1320 markings/sec, 115 secs
lola: sara is running 120 secs || 170789 markings, 219948 edges, 1037 markings/sec, 120 secs
lola: sara is running 125 secs || 176112 markings, 226832 edges, 1065 markings/sec, 125 secs
lola: sara is running 130 secs || 182985 markings, 235534 edges, 1375 markings/sec, 130 secs
lola: sara is running 135 secs || 190424 markings, 245068 edges, 1488 markings/sec, 135 secs
lola: sara is running 140 secs || 197863 markings, 254625 edges, 1488 markings/sec, 140 secs
lola: sara is running 145 secs || 205273 markings, 264120 edges, 1482 markings/sec, 145 secs
lola: sara is running 150 secs || 212901 markings, 273884 edges, 1526 markings/sec, 150 secs
lola: sara is running 155 secs || 220608 markings, 283761 edges, 1541 markings/sec, 155 secs
lola: sara is running 160 secs || 228319 markings, 293619 edges, 1542 markings/sec, 160 secs
lola: sara is running 165 secs || 236219 markings, 303723 edges, 1580 markings/sec, 165 secs
lola: sara is running 170 secs || 244029 markings, 313690 edges, 1562 markings/sec, 170 secs
lola: sara is running 175 secs || 251312 markings, 323324 edges, 1457 markings/sec, 175 secs
lola: sara is running 180 secs || 258755 markings, 332992 edges, 1489 markings/sec, 180 secs
lola: sara is running 185 secs || 266268 markings, 342470 edges, 1503 markings/sec, 185 secs
lola: sara is running 190 secs || 273648 markings, 351820 edges, 1476 markings/sec, 190 secs
lola: sara is running 195 secs || 281027 markings, 361182 edges, 1476 markings/sec, 195 secs
lola: sara is running 200 secs || 288488 markings, 370712 edges, 1492 markings/sec, 200 secs
lola: sara is running 205 secs || 296074 markings, 380338 edges, 1517 markings/sec, 205 secs
lola: sara is running 210 secs || 303366 markings, 389597 edges, 1458 markings/sec, 210 secs
lola: sara is running 215 secs || 310756 markings, 398977 edges, 1478 markings/sec, 215 secs
lola: sara is running 220 secs || 318191 markings, 408442 edges, 1487 markings/sec, 220 secs
lola: sara is running 225 secs || 325670 markings, 417928 edges, 1496 markings/sec, 225 secs
lola: sara is running 230 secs || 333002 markings, 427171 edges, 1466 markings/sec, 230 secs
lola: sara is running 235 secs || 340490 markings, 436742 edges, 1498 markings/sec, 235 secs
lola: sara is running 240 secs || 348041 markings, 446364 edges, 1510 markings/sec, 240 secs
lola: sara is running 245 secs || 355594 markings, 455951 edges, 1511 markings/sec, 245 secs
lola: sara is running 250 secs || 363133 markings, 465497 edges, 1508 markings/sec, 250 secs
lola: sara is running 255 secs || 370646 markings, 475069 edges, 1503 markings/sec, 255 secs
lola: sara is running 260 secs || 378196 markings, 484625 edges, 1510 markings/sec, 260 secs
lola: sara is running 265 secs || 385486 markings, 493831 edges, 1458 markings/sec, 265 secs
lola: sara is running 270 secs || 392650 markings, 502955 edges, 1433 markings/sec, 270 secs
lola: sara is running 275 secs || 399925 markings, 512224 edges, 1455 markings/sec, 275 secs
lola: sara is running 280 secs || 407511 markings, 521892 edges, 1517 markings/sec, 280 secs
lola: sara is running 285 secs || 415101 markings, 531513 edges, 1518 markings/sec, 285 secs
lola: sara is running 290 secs || 422684 markings, 541154 edges, 1517 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-4b-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="DLCshifumi-PT-4b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-4b.tgz
mv DLCshifumi-PT-4b execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is DLCshifumi-PT-4b, 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 r066-smll-152649737200194"
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 '' ReachabilityCardinality.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 ;