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 572K
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 290K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580500075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527145120574


BK_STOP 1527145177705

--------------------
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 QuasiCertifProtocol-PT-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, '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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 796, 'Memory': 107.17, 'Tool': 'lola'}, {'Time': 882, 'Memory': 107.41, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-PT-10...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-PT-10 @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-10-ReachabilityCardinality.task
lola: E (F ((((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= 0) OR (CstopAbort <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10)) AND (2 <= AstopAbort)))) : E (F ((3 <= a1))) : E (F (())) : A (G ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9 <= AstopAbort))) : A (G (((AstopOK <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9) OR ((2 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) AND (3 <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9) AND (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= 0))))) : E (F ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 + 1 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9))) : E (F (((a2 <= 1) AND (n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= 0) AND (n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9 + 1 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9) AND (n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + 1 <= Astart)))) : A (G (((s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10 <= 1) OR (AstopOK <= 0) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 <= 2)))) : E (F ((3 <= s3_0))) : E (F ((1 <= s3_5))) : E (F ((n9_4_0 + 1 <= n7_2_0))) : A (G (((n9_8_2 + 1 <= n8_4_2) OR (n9_1_6 <= n9_1_0)))) : E (F ((n9_2_4 + 1 <= n7_8_1))) : E (F (((n9_5_2 + 1 <= n7_0_2) AND ((3 <= n9_0_0) OR (n3_3 <= s2_9)) AND ((CstopOK_2 <= 1) OR (s5_7 <= 2))))) : A (G ((n9_3_10 <= n9_10_1))) : A (G (((n9_10_1 <= 1) OR (n8_3_7 + 1 <= n9_9_4) OR (n4_7 + 1 <= n7_1_1) OR (n3_6 <= 0))))
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 ((((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= 0) OR (CstopAbort <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10)) AND (2 <= AstopAbort))))
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 700 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality.sara.
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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= a1)))
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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality.sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_... (shortened)
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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((AstopOK <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9) OR ((2 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) AND (3 <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_... (shortened)
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 700 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: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-4.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: 40 markings, 39 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 + 1 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((a2 <= 1) AND (n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= 0) AND (n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_... (shortened)
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 700 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
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-5.sara.
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

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 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10 <= 1) OR (AstopOK <= 0) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10) OR (s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10 <= 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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-7.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: 65 markings, 64 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= s3_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-8.sara.
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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= s3_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((n9_4_0 + 1 <= n7_2_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n9_8_2 + 1 <= n8_4_2) OR (n9_1_6 <= n9_1_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 700 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 QuasiCertifProtocol-PT-10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((n9_2_4 + 1 <= n7_8_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n9_5_2 + 1 <= n7_0_2) AND ((3 <= n9_0_0) OR (n3_3 <= s2_9)) AND ((CstopOK_2 <= 1) OR (s5_7 <= 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 700 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((n9_3_10 <= n9_10_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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 63 markings, 62 edges
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n9_10_1 <= 1) OR (n8_3_7 + 1 <= n9_9_4) OR (n4_7 + 1 <= n7_1_1) OR (n3_6 <= 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 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-ReachabilityCardinality-15.sara.
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: RESULT
lola:
SUMMARY: no no no no no yes no no no yes yes no yes yes no yes
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-ReachabilityCardinality-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="QuasiCertifProtocol-PT-10"
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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 QuasiCertifProtocol-PT-10, 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 r138-qhx2-152673580500075"
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 ;