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 232K
-rw-r--r-- 1 mcc users 3.5K 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 3.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K 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.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-smll-152658633700224
=====================================================================

--------------------
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 IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526734569468


BK_STOP 1526734615513

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using IOTPpurchase-PT-C12M10P15D17 as instance name.
Using IOTPpurchase as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 165, 'Memory': 110.85, 'Tool': 'lola'}, {'Time': 248, 'Memory': 111.65, 'Tool': 'lola'}, {'Time': 7499, 'Memory': 472.68, 'Tool': 'itstools'}, {'Time': 7698, 'Memory': 464.59, 'Tool': 'itstools'}, {'Time': 1159089, 'Memory': 12517.89, 'Tool': 'marcie'}, {'Time': 1161565, 'Memory': 12517.93, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 45.448484848484846x far from the best tool lola.
ReachabilityFireability lola IOTPpurchase-PT-C12M10P15D17...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
IOTPpurchase-PT-C12M10P15D17: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ IOTPpurchase-PT-C12M10P15D17 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 156/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability.task
lola: E (F ((((NOT FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_2)) OR FIREABLE(GetDeliveryResponse_t6_5)) AND FIREABLE(CheckRequest_t2)))) : E (F (FIREABLE(CheckDeliveryNote_t6_6))) : E (F (((FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(WhatDeliverDecision_t6_0)) AND (FIREABLE(PutHowDeliver_t7_2) OR NOT FIREABLE(CheckPaymentReseitp_t3_10))))) : E (F (FIREABLE(GetDeliveryRequest_t8_0))) : A (G ((NOT FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(PutPaymentAmount_t4_5) OR (NOT FIREABLE(PaymentResponse_t3_9) AND NOT FIREABLE(CheckBrandSelection_t4_4)) OR FIREABLE(TradeDecision_t3_0)))) : E (F (FIREABLE(CheckPaymentRequest_t5_1))) : E (F ((NOT FIREABLE(GetBrandSelection_t4_3) AND FIREABLE(PaymentResponse_t3_9)))) : E (F ((FIREABLE(GetHowDeliver_t6_2) OR (FIREABLE(GetHowDeliver_t6_2) AND ((FIREABLE(TradeDecision_t3_0) AND FIREABLE(t7_4)) OR FIREABLE(PutBrandList_t4_2)))))) : E (F ((FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(t8_4) OR (FIREABLE(MakeChoice_t1) AND FIREABLE(PutWhatDeliver_t6_1))))) : A (G (NOT FIREABLE(PutDeliveryResponse_t8_2))) : E (F ((FIREABLE(CheckDeliveryInfo_t6_3) AND (NOT FIREABLE(CheckDeliveryRequest_t8_1) OR NOT FIREABLE(SelectBrand_t3_3)) AND ((FIREABLE(GetWhatDeliver_t7_0) AND NOT FIREABLE(GetPaymentRequest_t5_0)) OR NOT FIREABLE(PaymentResponse_t5_3))))) : E (F (FIREABLE(PutWhatDeliver_t6_1))) : E (F ((FIREABLE(PaymentResponse_t5_3) AND FIREABLE(CheckWhatDeliver_t7_1) AND (FIREABLE(PaymentResponse_t5_3) OR FIREABLE(GetBrandList_t3_2))))) : A (G (((NOT FIREABLE(TradeDecision_t3_0) OR NOT FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(BrandDecision_t4_1)) AND (NOT FIREABLE(t7_4) OR (FIREABLE(CheckDeliveryNote_t6_6) AND FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(GetDeliveryResponse_t6_5)))))) : E (F (FIREABLE(GetPaymentRequest_t5_0))) : E (F (((FIREABLE(CheckPaymentReseitp_t3_10) OR (FIREABLE(GetPaymentAmount_t3_5) AND FIREABLE(t6_7) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PaymentExchange_t5_2)))) AND (FIREABLE(CheckRequest_t2) OR FIREABLE(PutBrandSelection_t3_4) OR FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(PaymentResponse_t5_3) OR FIREABLE(GetPaymentAmount_t3_5)))))
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 ((((NOT FIREABLE(CheckDeliveryRequest_t8_1) AND FIREABLE(PaymentExchange_t5_2)) OR FIREABLE(GetDeliveryResponse_t6_5)) AND FIREABLE(CheckRequest_t2))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 28 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CheckDeliveryNote_t6_6)))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(GetWhatDeliver_t7_0) OR FIREABLE(WhatDeliverDecision_t6_0)) AND (FIREABLE(PutHowDeliver_t7_2) OR NOT FIREABLE(CheckPaymentReseitp_t3_10)))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 33 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GetDeliveryRequest_t8_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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(CheckBrandSelection_t4_4) OR NOT FIREABLE(PutPaymentAmount_t4_5) OR (NOT FIREABLE(PaymentResponse_t3_9) AND NOT FIREABLE(CheckBrandSelection_t4_4)) OR FIREABLE(TradeDecision_t3_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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 15 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 53 markings, 52 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(CheckPaymentRequest_t5_1)))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(GetBrandSelection_t4_3) AND FIREABLE(PaymentResponse_t3_9))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GetHowDeliver_t6_2) OR (FIREABLE(GetHowDeliver_t6_2) AND ((FIREABLE(TradeDecision_t3_0) AND FIREABLE(t7_4)) OR FIREABLE(PutBrandList_t4_2))))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(t8_4) OR (FIREABLE(MakeChoice_t1) AND FIREABLE(PutWhatDeliver_t6_1)))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(PutDeliveryResponse_t8_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: lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
========================================
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(CheckDeliveryInfo_t6_3) AND (NOT FIREABLE(CheckDeliveryRequest_t8_1) OR NOT FIREABLE(SelectBrand_t3_3)) AND ((FIREABLE(GetWhatDeliver_t7_0) AND NOT FIREABLE(GetPaymentRequest_t5_0)) OR NOT FIREABLE(PaymentResponse_t5_3)))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 150 literals and 42 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
sara: try reading problem file IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-8.sara.
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(PutWhatDeliver_t6_1)))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(PaymentResponse_t5_3) AND FIREABLE(CheckWhatDeliver_t7_1) AND (FIREABLE(PaymentResponse_t5_3) OR FIREABLE(GetBrandList_t3_2)))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 19 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-12.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 68 markings, 67 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(TradeDecision_t3_0) OR NOT FIREABLE(GetHowDeliver_t6_2) OR FIREABLE(BrandDecision_t4_1)) AND (NOT FIREABLE(t7_4) OR (FIREABLE(CheckDeliveryNote_t6_6) AND FIREABLE(PutPaymentRequest_t3_7) AND FIREABLE(GetDeliveryResponse_t6_5))))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: state equation: Generated DNF with 26 literals and 12 conjunctive subformulas
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(GetPaymentRequest_t5_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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(CheckPaymentReseitp_t3_10) OR (FIREABLE(GetPaymentAmount_t3_5) AND FIREABLE(t6_7) AND (FIREABLE(GetPaymentRequest_t5_0) OR FIREABLE(PaymentExchange_t5_2)))) AND (FIREABLE(CheckRequest_t2) OR FIREABLE(PutBrandSelection_t3_4) OR FIREABLE(CheckPaymentAmount_t3_6) OR FIREABLE(PaymentResponse_t5_3) OR FIREABLE(GetPaymentAmount_t3_5)))))
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 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 108 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes no yes yes yes no yes yes
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C12M10P15D17-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is IOTPpurchase-PT-C12M10P15D17, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-smll-152658633700224"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;