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 1.1M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.9K 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 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 956K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is AutoFlight-PT-48b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-qhx1-152646247300173
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526897613212


BK_STOP 1526898359506

--------------------
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 AutoFlight-PT-48b as instance name.
Using AutoFlight 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': 514296, 'Memory': 2695.04, 'Tool': 'lola'}, {'Time': 517328, 'Memory': 2732.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola AutoFlight-PT-48b...

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


checking for too many tokens
===========================================================================================
AutoFlight-PT-48b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ AutoFlight-PT-48b @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7886/65536 symbol table entries, 1706 collisions
lola: preprocessing...
lola: finding significant places
lola: 3950 places, 3936 transitions, 3692 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4350 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-48b-ReachabilityCardinality.task
lola: E (F (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660)))) : A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87)))) : A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536))))) : E (F (((p1564 + 1 <= p3845) AND (1 <= p2709)))) : E (F ((1 <= p1303))) : E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547)))) : E (F ((2 <= p3223))) : A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 0))))) : A (G ((p3681 <= 1))) : E (F ((3 <= p516))) : E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 0))))) : A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414))))) : E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638)))) : E (F (((p858 + 1 <= p3228) AND (3 <= p433)))) : A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 0))))) : E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 (((p339 <= 0) AND (p2099 + 1 <= p2561) AND (p1014 <= 0) AND (p151 + 1 <= p2660))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 58984 markings, 136576 edges, 11797 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3184 + 1 <= p861) OR (p3797 <= 0) OR (3 <= p87))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 51688 markings, 117534 edges, 10338 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2998 <= p186) AND ((p2646 <= 0) OR (p2394 + 1 <= p1536)))))
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 464 bytes per marking, with 20 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 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1564 + 1 <= p3845) AND (1 <= p2709))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 76081 markings, 123134 edges, 15216 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 214817 markings, 360515 edges, 27747 markings/sec, 5 secs
lola: sara is running 10 secs || 342380 markings, 612973 edges, 25513 markings/sec, 10 secs
lola: sara is running 15 secs || 481149 markings, 865112 edges, 27754 markings/sec, 15 secs
lola: sara is running 20 secs || 613990 markings, 1123013 edges, 26568 markings/sec, 20 secs
lola: sara is running 25 secs || 734304 markings, 1381145 edges, 24063 markings/sec, 25 secs
lola: sara is running 30 secs || 866614 markings, 1642017 edges, 26462 markings/sec, 30 secs
lola: sara is running 35 secs || 1009166 markings, 1889208 edges, 28510 markings/sec, 35 secs
lola: sara is running 40 secs || 1139088 markings, 2135070 edges, 25984 markings/sec, 40 secs
lola: sara is running 45 secs || 1259354 markings, 2410278 edges, 24053 markings/sec, 45 secs
lola: sara is running 50 secs || 1388142 markings, 2666060 edges, 25758 markings/sec, 50 secs
lola: sara is running 55 secs || 1530954 markings, 2920803 edges, 28562 markings/sec, 55 secs
lola: sara is running 60 secs || 1665738 markings, 3161535 edges, 26957 markings/sec, 60 secs
lola: sara is running 65 secs || 1781456 markings, 3429030 edges, 23144 markings/sec, 65 secs
lola: sara is running 70 secs || 1909126 markings, 3689301 edges, 25534 markings/sec, 70 secs
lola: sara is running 75 secs || 2041474 markings, 3934140 edges, 26470 markings/sec, 75 secs
lola: sara is running 80 secs || 2179067 markings, 4163502 edges, 27519 markings/sec, 80 secs
lola: sara is running 85 secs || 2298257 markings, 4432283 edges, 23838 markings/sec, 85 secs
lola: sara is running 90 secs || 2421751 markings, 4694941 edges, 24699 markings/sec, 90 secs
lola: sara is running 95 secs || 2554909 markings, 4951668 edges, 26632 markings/sec, 95 secs
lola: sara is running 100 secs || 2697498 markings, 5186093 edges, 28518 markings/sec, 100 secs
lola: sara is running 105 secs || 2818125 markings, 5446407 edges, 24125 markings/sec, 105 secs
lola: sara is running 110 secs || 2938707 markings, 5711506 edges, 24116 markings/sec, 110 secs
lola: sara is running 115 secs || 3069590 markings, 5966350 edges, 26177 markings/sec, 115 secs
lola: sara is running 120 secs || 3208895 markings, 6200761 edges, 27861 markings/sec, 120 secs
lola: sara is running 125 secs || 3335448 markings, 6456048 edges, 25311 markings/sec, 125 secs
lola: sara is running 130 secs || 3454362 markings, 6722517 edges, 23783 markings/sec, 130 secs
lola: sara is running 135 secs || 3583708 markings, 6978146 edges, 25869 markings/sec, 135 secs
lola: sara is running 140 secs || 3722622 markings, 7218971 edges, 27783 markings/sec, 140 secs
lola: sara is running 145 secs || 3865655 markings, 7456803 edges, 28607 markings/sec, 145 secs
lola: sara is running 150 secs || 3997508 markings, 7690465 edges, 26371 markings/sec, 150 secs
lola: sara is running 155 secs || 4066549 markings, 7943098 edges, 13808 markings/sec, 155 secs
lola: sara is running 160 secs || 4198032 markings, 8197189 edges, 26297 markings/sec, 160 secs
lola: sara is running 165 secs || 4331896 markings, 8450684 edges, 26773 markings/sec, 165 secs
lola: sara is running 170 secs || 4460029 markings, 8700812 edges, 25627 markings/sec, 170 secs
lola: sara is running 175 secs || 4595702 markings, 8958399 edges, 27135 markings/sec, 175 secs
lola: sara is running 180 secs || 4732228 markings, 9216463 edges, 27305 markings/sec, 180 secs
lola: sara is running 185 secs || 4864584 markings, 9470248 edges, 26471 markings/sec, 185 secs
lola: sara is running 190 secs || 4989719 markings, 9716925 edges, 25027 markings/sec, 190 secs
lola: sara is running 195 secs || 5105849 markings, 9950079 edges, 23226 markings/sec, 195 secs
lola: sara is running 200 secs || 5222785 markings, 10180096 edges, 23387 markings/sec, 200 secs
lola: sara is running 205 secs || 5348180 markings, 10387048 edges, 25079 markings/sec, 205 secs
lola: sara is running 210 secs || 5454596 markings, 10631182 edges, 21283 markings/sec, 210 secs
lola: sara is running 215 secs || 5557905 markings, 10904919 edges, 20662 markings/sec, 215 secs
lola: sara is running 220 secs || 5678742 markings, 11162546 edges, 24167 markings/sec, 220 secs
lola: sara is running 225 secs || 5807188 markings, 11402748 edges, 25689 markings/sec, 225 secs
lola: sara is running 230 secs || 5943454 markings, 11632920 edges, 27253 markings/sec, 230 secs
lola: sara is running 235 secs || 6047310 markings, 11908421 edges, 20771 markings/sec, 235 secs
lola: sara is running 240 secs || 6153649 markings, 12177140 edges, 21268 markings/sec, 240 secs
lola: sara is running 245 secs || 6278539 markings, 12424674 edges, 24978 markings/sec, 245 secs
lola: sara is running 250 secs || 6414720 markings, 12664175 edges, 27236 markings/sec, 250 secs
lola: sara is running 255 secs || 6538235 markings, 12909235 edges, 24703 markings/sec, 255 secs
lola: sara is running 260 secs || 6646379 markings, 13192368 edges, 21629 markings/sec, 260 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 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1303)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3329 <= p2241) OR (3 <= p814)) AND ((2 <= p2596) OR (p2681 <= p187)) AND (1 <= p2577) AND (3 <= p1445) AND (p1058 <= p1547))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 76147 markings, 131701 edges, 15229 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 215642 markings, 388576 edges, 27899 markings/sec, 5 secs
lola: sara is running 10 secs || 350993 markings, 650889 edges, 27070 markings/sec, 10 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 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3223)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 46533 markings, 111837 edges, 9307 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p290 <= p3555) OR (p1653 <= p2316)) AND (p3227 <= p3171)) OR ((p1969 <= 1) AND (p425 <= 0)))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 35372 markings, 93216 edges, 7074 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 108955 markings, 327812 edges, 14717 markings/sec, 5 secs
lola: sara is running 10 secs || 182505 markings, 568084 edges, 14710 markings/sec, 10 secs
lola: sara is running 15 secs || 255381 markings, 804365 edges, 14575 markings/sec, 15 secs
lola: sara is running 20 secs || 327622 markings, 1038419 edges, 14448 markings/sec, 20 secs
lola: sara is running 25 secs || 403668 markings, 1254110 edges, 15209 markings/sec, 25 secs
lola: sara is running 30 secs || 479319 markings, 1491954 edges, 15130 markings/sec, 30 secs
lola: sara is running 35 secs || 554647 markings, 1732883 edges, 15066 markings/sec, 35 secs
lola: sara is running 40 secs || 626352 markings, 1982313 edges, 14341 markings/sec, 40 secs
lola: sara is running 45 secs || 697563 markings, 2231741 edges, 14242 markings/sec, 45 secs
lola: sara is running 50 secs || 769431 markings, 2480968 edges, 14374 markings/sec, 50 secs
lola: sara is running 55 secs || 841353 markings, 2724551 edges, 14384 markings/sec, 55 secs
lola: sara is running 60 secs || 911301 markings, 2967735 edges, 13990 markings/sec, 60 secs
lola: sara is running 65 secs || 981828 markings, 3212306 edges, 14105 markings/sec, 65 secs
lola: sara is running 70 secs || 1053169 markings, 3458966 edges, 14268 markings/sec, 70 secs
lola: sara is running 75 secs || 1118695 markings, 3689750 edges, 13105 markings/sec, 75 secs
lola: sara is running 80 secs || 1192437 markings, 3946108 edges, 14748 markings/sec, 80 secs
lola: sara is running 85 secs || 1263886 markings, 4196548 edges, 14290 markings/sec, 85 secs
lola: sara is running 90 secs || 1338123 markings, 4456662 edges, 14847 markings/sec, 90 secs
lola: sara is running 95 secs || 1409922 markings, 4708175 edges, 14360 markings/sec, 95 secs
lola: sara is running 100 secs || 1480253 markings, 4950562 edges, 14066 markings/sec, 100 secs
lola: sara is running 105 secs || 1549708 markings, 5192695 edges, 13891 markings/sec, 105 secs
lola: sara is running 110 secs || 1619786 markings, 5434524 edges, 14016 markings/sec, 110 secs
lola: sara is running 115 secs || 1689294 markings, 5674720 edges, 13902 markings/sec, 115 secs
lola: sara is running 120 secs || 1759599 markings, 5920294 edges, 14061 markings/sec, 120 secs
lola: sara is running 125 secs || 1830229 markings, 6168208 edges, 14126 markings/sec, 125 secs
lola: sara is running 130 secs || 1901316 markings, 6416074 edges, 14217 markings/sec, 130 secs
lola: sara is running 135 secs || 1969610 markings, 6653103 edges, 13659 markings/sec, 135 secs
lola: sara is running 140 secs || 2037433 markings, 6887207 edges, 13565 markings/sec, 140 secs
lola: sara is running 145 secs || 2104065 markings, 7116448 edges, 13326 markings/sec, 145 secs
lola: sara is running 150 secs || 2169425 markings, 7342673 edges, 13072 markings/sec, 150 secs
lola: sara is running 155 secs || 2236374 markings, 7578471 edges, 13390 markings/sec, 155 secs
lola: sara is running 160 secs || 2306339 markings, 7824020 edges, 13993 markings/sec, 160 secs
lola: sara is running 165 secs || 2374782 markings, 8062974 edges, 13689 markings/sec, 165 secs
lola: sara is running 170 secs || 2446194 markings, 8308776 edges, 14282 markings/sec, 170 secs
lola: sara is running 175 secs || 2513867 markings, 8543910 edges, 13535 markings/sec, 175 secs
lola: sara is running 180 secs || 2583403 markings, 8782659 edges, 13907 markings/sec, 180 secs
lola: sara is running 185 secs || 2650744 markings, 9016085 edges, 13468 markings/sec, 185 secs
lola: sara is running 190 secs || 2722430 markings, 9269284 edges, 14337 markings/sec, 190 secs
lola: sara is running 195 secs || 2794141 markings, 9520892 edges, 14342 markings/sec, 195 secs
lola: sara is running 200 secs || 2867334 markings, 9771724 edges, 14639 markings/sec, 200 secs
lola: sara is running 205 secs || 2937705 markings, 10012412 edges, 14074 markings/sec, 205 secs
lola: sara is running 210 secs || 3009912 markings, 10259705 edges, 14441 markings/sec, 210 secs
lola: sara is running 215 secs || 3081473 markings, 10510936 edges, 14312 markings/sec, 215 secs
lola: sara is running 220 secs || 3151796 markings, 10751548 edges, 14065 markings/sec, 220 secs
lola: sara is running 225 secs || 3221416 markings, 10989813 edges, 13924 markings/sec, 225 secs
lola: sara is running 230 secs || 3291721 markings, 11234792 edges, 14061 markings/sec, 230 secs
lola: sara is running 235 secs || 3363168 markings, 11480250 edges, 14289 markings/sec, 235 secs
lola: sara is running 240 secs || 3434171 markings, 11723838 edges, 14201 markings/sec, 240 secs
lola: sara is running 245 secs || 3503582 markings, 11964463 edges, 13882 markings/sec, 245 secs
lola: sara is running 250 secs || 3574563 markings, 12208950 edges, 14196 markings/sec, 250 secs
lola: sara is running 255 secs || 3639787 markings, 12433018 edges, 13045 markings/sec, 255 secs
lola: sara is running 260 secs || 3703278 markings, 12652624 edges, 12698 markings/sec, 260 secs
lola: sara is running 265 secs || 3767266 markings, 12874512 edges, 12798 markings/sec, 265 secs
----- Kill lola and sara stderr -----
lola: sara is running 270 secs || 3834626 markings, 13110012 edges, 13472 markings/sec, 270 secs
lola: sara is running 275 secs || 3900860 markings, 13341616 edges, 13247 markings/sec, 275 secs
lola: sara is running 280 secs || 3967450 markings, 13574437 edges, 13318 markings/sec, 280 secs
lola: sara is running 285 secs || 4032947 markings, 13803399 edges, 13099 markings/sec, 285 secs
lola: sara is running 290 secs || 4104266 markings, 14052656 edges, 14264 markings/sec, 290 secs
lola: sara is running 295 secs || 4174481 markings, 14293310 edges, 14043 markings/sec, 295 secs
lola: sara is running 300 secs || 4242339 markings, 14526429 edges, 13572 markings/sec, 300 secs
lola: sara is running 305 secs || 4310722 markings, 14762131 edges, 13677 markings/sec, 305 secs
lola: sara is running 310 secs || 4381244 markings, 15004994 edges, 14104 markings/sec, 310 secs
lola: sara is running 315 secs || 4453401 markings, 15258013 edges, 14431 markings/sec, 315 secs
lola: sara is running 320 secs || 4526232 markings, 15511989 edges, 14566 markings/sec, 320 secs
lola: sara is running 325 secs || 4597426 markings, 15758696 edges, 14239 markings/sec, 325 secs
lola: sara is running 330 secs || 4668444 markings, 16003616 edges, 14204 markings/sec, 330 secs
lola: sara is running 335 secs || 4737026 markings, 16239688 edges, 13716 markings/sec, 335 secs
lola: sara is running 340 secs || 4807073 markings, 16479205 edges, 14009 markings/sec, 340 secs
lola: sara is running 345 secs || 4878702 markings, 16728864 edges, 14326 markings/sec, 345 secs
lola: sara is running 350 secs || 4951285 markings, 16982138 edges, 14517 markings/sec, 350 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3681 <= 1)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 44786 markings, 107317 edges, 8957 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p516)))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 187 markings, 186 edges
lola: ========================================
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2196 + 1 <= p2623) AND ((p1658 <= 1) OR (p601 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2042 markings, 2088 edges
lola: ========================================
lola: subprocess 11 will run for 570 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1542 <= 1) OR ((3 <= p3542) AND (2 <= p1300)) OR ((2 <= p991) AND (p1353 <= p793) AND (3 <= p414)))))
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 464 bytes per marking, with 20 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 107 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 713 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p185 + 1 <= p1435) AND (p254 <= 2)) OR (1 <= p1638))))
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 464 bytes per marking, with 20 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 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100 markings, 99 edges
lola: ========================================
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p858 + 1 <= p3228) AND (3 <= p433))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 37208 markings, 84833 edges, 7442 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2416 <= 0) OR (p841 + 1 <= p2433) OR ((p1496 <= 0) AND (p1703 <= 0)))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 15 will run for 2844 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3389 + 1 <= p1538) OR ((p3047 + 1 <= p2705) AND (p875 + 1 <= p1958)))))
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 464 bytes per marking, with 20 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 2 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown yes no no unknown yes no yes yes yes no no yes
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="AutoFlight-PT-48b"
export BK_EXAMINATION="ReachabilityCardinality"
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/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b 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 AutoFlight-PT-48b, 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 r022-qhx1-152646247300173"
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 ;