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 236K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.0K 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 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.2K 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 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580500059
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527144630269


BK_STOP 1527144686803

--------------------
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-02 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 149, 'Memory': 106.46, 'Tool': 'lola'}, {'Time': 227, 'Memory': 107.6, 'Tool': 'lola'}, {'Time': 358, 'Memory': 101.4, 'Tool': 'gspn'}, {'Time': 2314, 'Memory': 160.7, 'Tool': 'gspn'}, {'Time': 2440, 'Memory': 2206.15, 'Tool': 'marcie'}, {'Time': 2654, 'Memory': 2206.18, 'Tool': 'marcie'}, {'Time': 4349, 'Memory': 247.11, 'Tool': 'itstools'}, {'Time': 4560, 'Memory': 237.21, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola QuasiCertifProtocol-PT-02...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ QuasiCertifProtocol-PT-02 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: (((1 <= a4) OR E (F (((2 <= s4_0 + s4_1 + s4_2) AND (1 <= SstopOK_0 + SstopOK_1 + SstopOK_2))))) OR E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))) : A (F (E (((1 <= CstopAbort) U (1 <= AstopOK))))) : A (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2))))) : ((A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort))) OR E (((2 <= s5_0 + s5_1 + s5_2) U (1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1)))) AND E (G (E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)))))) : A (F (NOT(E (F ((Astart <= Sstart_2 + Sstart_1 + Sstart_0)))))) : ((A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0))) AND (A (X ((2 <= Astart))) OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))) OR A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0)))))) : E (G (E (F ((1 <= CstopAbort))))) : E (G ((s3_1 + s3_0 + s3_2 <= Cstart_0 + Cstart_1 + Cstart_2))) : NOT(A (F ((3 <= a4)))) : E (G (((1 <= s6_1) OR (n2_0 <= s2_2)))) : A (X (((n1_2 <= 2) AND A (F ((2 <= s6_2)))))) : A (F ((3 <= n4_2))) : NOT(E (G ((AstopAbort <= s5_0)))) : (A (F (((1 <= CstopOK_1) AND (n5_1 <= c1_1) AND (3 <= n7_2_0) AND (3 <= Cstart_0)))) OR (A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0)))) AND ((s5_2 <= 1) OR (SstopOK_0 <= 2) OR (AstopOK <= n7_1_0) OR (n9_0_2 <= n9_0_1) OR ((n7_0_2 <= n8_2_2) AND (n3_0 <= n9_1_0))))) : A (F ((n4_1 + 1 <= n9_0_0))) : ((A (G ((n8_1_2 <= Cstart_1))) OR E (G ((c1_2 <= n5_0)))) OR (3 <= n7_1_2))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= a4) OR E (F (((2 <= s4_0 + s4_1 + s4_2) AND (1 <= SstopOK_0 + SstopOK_1 + SstopOK_2))))) OR E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= a4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= a4)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= s4_0 + s4_1 + s4_2) AND (1 <= SstopOK_0 + SstopOK_1 + SstopOK_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 220 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: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 190 markings, 314 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (n1_0 + n1_1 + n1_2 + 1 <= c1_2 + c1_1 + c1_0)))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= CstopAbort) U (1 <= AstopOK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((1 <= CstopAbort) U (1 <= AstopOK)))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2)))))
lola: processed formula: A (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2)))))
lola: processed formula length: 303
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort))) OR E (((2 <= s5_0 + s5_1 + s5_2) U (1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1)))) AND E (G (E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
lola: processed formula: A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0 + 1 <= CstopOK_2 + CstopOK_1 + CstopOK_0))))
lola: processed formula length: 146
lola: 4 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((Astart <= Sstart_2 + Sstart_1 + Sstart_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((Sstart_2 + Sstart_1 + Sstart_0 + 1 <= Astart)))))
lola: processed formula: A (F (A (G ((Sstart_2 + Sstart_1 + Sstart_0 + 1 <= Astart)))))
lola: processed formula length: 62
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0))) AND (A (X ((2 <= Astart))) OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))) OR A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0)))
lola: processed formula: A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0)))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= CstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (1 <= CstopAbort)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 230 markings, 558 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((s3_1 + s3_0 + s3_2 <= Cstart_0 + Cstart_1 + Cstart_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Cstart_0 + Cstart_1 + Cstart_2 + 1 <= s3_1 + s3_0 + s3_2)))
lola: processed formula length: 73
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((3 <= a4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= a4)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= s6_1) OR (n2_0 <= s2_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((s6_1 <= 0) AND (s2_2 + 1 <= n2_0))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14 markings, 14 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((n1_2 <= 2) AND A (F ((2 <= s6_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((n1_2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((n1_2 <= 2)))
lola: processed formula: A (X ((n1_2 <= 2)))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((2 <= s6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= s6_2)))
lola: processed formula length: 25
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= n4_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= n4_2)))
lola: processed formula: A (F ((3 <= n4_2)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((AstopAbort <= s5_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((s5_0 + 1 <= AstopAbort)))
lola: processed formula: A (F ((s5_0 + 1 <= AstopAbort)))
lola: processed formula length: 32
lola: 3 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44 markings, 48 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= CstopOK_1) AND (n5_1 <= c1_1) AND (3 <= n7_2_0) AND (3 <= Cstart_0)))) OR (A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0)))) AND ((s5_2 <= 1) OR (SstopOK_0 <= 2) OR (AstopOK <= n7_1_0) OR (n9_0_2 <= n9_0_1) OR ((n7_0_2 <= n8_2_2) AND (n3_0 <= n9_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= CstopOK_1) AND (n5_1 <= c1_1) AND (3 <= n7_2_0) AND (3 <= Cstart_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= CstopOK_1) AND (n5_1 <= c1_1) AND (3 <= n7_2_0) AND (3 <= Cstart_0))))
lola: processed formula: A (F (((1 <= CstopOK_1) AND (n5_1 <= c1_1) AND (3 <= n7_2_0) AND (3 <= Cstart_0))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0))))
lola: processed formula: A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((n4_1 + 1 <= n9_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((n4_1 + 1 <= n9_0_0)))
lola: processed formula: A (F ((n4_1 + 1 <= n9_0_0)))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 224 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((n8_1_2 <= Cstart_1))) OR E (G ((c1_2 <= n5_0)))) OR (3 <= n7_1_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((n8_1_2 <= Cstart_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 220 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 not invariant.
lola: 20 markings, 19 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-02-CTLCardinality-15.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= n7_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= n7_1_2)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 86 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes yes yes yes no no no no no unknown
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-02"
export BK_EXAMINATION="CTLCardinality"
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-02.tgz
mv QuasiCertifProtocol-PT-02 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-02, examination is CTLCardinality"
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-152673580500059"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;