Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 26K 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 13K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K 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 6.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 686K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-qhx2-152673584400082
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527994996655


BK_STOP 1527995327991

--------------------
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 QuasiCertifProtocol-PT-18 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': 250950, 'Memory': 6817.97, 'Tool': 'lola'}, {'Time': 251197, 'Memory': 7364.62, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola QuasiCertifProtocol-PT-18...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-18: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ QuasiCertifProtocol-PT-18 @ 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: 1694/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1398 places, 296 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 391 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-18-ReachabilityCardinality.task
lola: A (G ((n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= a4))) : A (G (((SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 + 1 <= a2) OR (s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10 + 1 <= malicious_reservoir)))) : A (G ((AstopOK <= n7_17_0 + n7_17_1 + n7_17_2 + n7_17_3 + n7_17_4 + n7_17_5 + n7_17_6 + n7_17_7 + n7_17_8 + n7_17_9 + n7_3_10 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_6_0 + n7_15_0 + n7_18_0 + n7_4_10 + n7_7_0 + n7_14_10 + n7_16_10 + n7_8_10 + n7_5_10 + n7_11_10 + n7_10_0 + n7_0_10 + n7_8_0 + n7_12_10 + n7_1_10 + n7_2_10 + n7_13_10 + n7_9_0 + n7_9_9 + n7_9_8 + n7_9_7 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_2_18 + n7_2_17 + n7_2_16 + n7_2_15 + n7_13_11 + n7_13_12 + n7_13_13 + n7_13_14 + n7_13_15 + n7_13_16 + n7_13_17 + n7_13_18 + n7_7_10 + n7_7_11 + n7_7_12 + n7_7_13 + n7_7_14 + n7_7_15 + n7_7_16 + n7_7_17 + n7_7_18 + n7_2_14 + n7_2_13 + n7_2_12 + n7_2_11 + n7_18_10 + n7_18_11 + n7_18_12 + n7_18_13 + n7_18_14 + n7_18_15 + n7_18_16 + n7_18_17 + n7_18_18 + n7_1_11 + n7_1_12 + n7_1_13 + n7_1_14 + n7_1_15 + n7_1_16 + n7_1_17 + n7_1_18 + n7_12_11 + n7_12_12 + n7_12_13 + n7_12_14 + n7_12_15 + n7_12_16 + n7_12_17 + n7_12_18 + n7_6_10 + n7_6_11 + n7_6_12 + n7_6_13 + n7_6_14 + n7_6_15 + n7_6_16 + n7_6_17 + n7_6_18 + 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_17_10 + n7_17_11 + n7_17_12 + n7_17_13 + n7_17_14 + n7_17_15 + n7_17_16 + n7_17_17 + n7_17_18 + n7_0_11 + n7_0_12 + n7_0_13 + n7_0_14 + n7_0_15 + n7_0_16 + n7_0_17 + n7_0_18 + n7_8_18 + n7_8_17 + 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_8_16 + n7_11_11 + n7_11_12 + n7_11_13 + n7_11_14 + n7_11_15 + n7_11_16 + n7_11_17 + n7_11_18 + n7_11_0 + n7_11_1 + n7_11_2 + n7_11_3 + n7_11_4 + n7_11_5 + n7_11_6 + n7_11_7 + n7_11_8 + n7_11_9 + n7_8_15 + n7_5_11 + n7_5_12 + n7_5_13 + n7_5_14 + n7_5_15 + n7_5_16 + n7_5_17 + n7_5_18 + n7_8_14 + n7_8_13 + n7_8_12 + n7_8_11 + 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_14_18 + n7_14_17 + n7_14_16 + n7_14_15 + n7_14_14 + n7_14_13 + n7_12_0 + n7_12_1 + n7_12_2 + n7_12_3 + n7_12_4 + n7_12_5 + n7_12_6 + n7_12_7 + n7_12_8 + n7_12_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_14_12 + n7_16_11 + n7_16_12 + n7_16_13 + n7_16_14 + n7_16_15 + n7_16_16 + n7_16_17 + n7_16_18 + n7_14_11 + n7_7_9 + n7_13_0 + n7_13_1 + n7_13_2 + n7_13_3 + n7_13_4 + n7_13_5 + n7_13_6 + n7_13_7 + n7_13_8 + n7_13_9 + 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_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_18_9 + n7_14_0 + n7_14_1 + n7_14_2 + n7_14_3 + n7_14_4 + n7_14_5 + n7_14_6 + n7_14_7 + n7_14_8 + n7_14_9 + n7_10_10 + n7_10_11 + n7_10_12 + n7_10_13 + n7_10_14 + n7_10_15 + n7_10_16 + n7_10_17 + n7_10_18 + n7_18_8 + n7_4_11 + n7_4_12 + n7_4_13 + n7_4_14 + n7_4_15 + n7_4_16 + n7_4_17 + n7_4_18 + n7_18_7 + 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_18_6 + n7_18_5 + n7_18_4 + n7_18_3 + n7_18_2 + n7_18_1 + n7_15_1 + n7_15_2 + n7_15_3 + n7_15_4 + n7_15_5 + n7_15_6 + n7_15_7 + n7_15_8 + n7_15_9 + 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_6_9 + n7_6_8 + n7_6_7 + n7_6_6 + n7_6_5 + n7_6_4 + n7_6_3 + n7_6_2 + n7_15_10 + n7_15_11 + n7_15_12 + n7_15_13 + n7_15_14 + n7_15_15 + n7_15_16 + n7_15_17 + n7_15_18 + n7_9_10 + n7_9_11 + n7_9_12 + n7_9_13 + n7_9_14 + n7_9_15 + n7_9_16 + n7_9_17 + n7_9_18 + n7_16_0 + n7_16_1 + n7_16_2 + n7_16_3 + n7_16_4 + n7_16_5 + n7_16_6 + n7_16_7 + n7_16_8 + n7_16_9 + n7_6_1 + 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))) : E (F (((Astart <= 0) AND (a3 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10) AND (2 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) AND (2 <= n8_14_10 + n8_11_0 + n8_5_10 + n8_0_0 + n8_10_10 + n8_12_0 + n8_1_0 + n8_13_0 + n8_8_10 + n8_7_0 + n8_6_0 + n8_17_0 + n8_2_0 + n8_16_0 + n8_9_10 + n8_18_10 + n8_15_0 + n8_4_10 + n8_3_0 + n8_14_2 + n8_14_3 + n8_14_4 + n8_14_5 + n8_14_6 + n8_14_7 + n8_14_8 + n8_14_9 + n8_13_10 + n8_13_11 + n8_13_12 + n8_13_13 + n8_13_14 + n8_13_15 + n8_13_16 + n8_13_17 + n8_13_18 + n8_14_1 + n8_14_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_3_7 + n8_3_8 + n8_3_9 + n8_4_11 + n8_4_12 + n8_4_13 + n8_4_14 + n8_4_15 + n8_4_16 + n8_4_17 + n8_4_18 + n8_15_1 + n8_15_2 + n8_15_3 + n8_15_4 + n8_15_5 + n8_15_6 + n8_15_7 + n8_15_8 + n8_15_9 + n8_4_0 + n8_4_1 + n8_4_2 + n8_4_3 + n8_4_4 + n8_4_5 + n8_4_6 + n8_4_7 + n8_4_8 + n8_4_9 + n8_18_11 + n8_18_12 + n8_18_13 + n8_18_14 + n8_18_15 + n8_18_16 + n8_18_17 + n8_18_18 + n8_9_11 + n8_9_12 + n8_9_13 + n8_9_14 + n8_9_15 + n8_9_16 + n8_9_17 + n8_9_18 + n8_16_1 + n8_16_2 + n8_16_3 + n8_16_4 + n8_16_5 + n8_16_6 + n8_16_7 + n8_16_8 + n8_16_9 + n8_5_0 + n8_5_1 + n8_5_2 + n8_5_3 + n8_5_4 + n8_5_5 + n8_5_6 + n8_5_7 + n8_5_8 + n8_5_9 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_17_1 + n8_17_2 + n8_17_3 + n8_17_4 + n8_17_5 + n8_17_6 + n8_17_7 + n8_17_8 + n8_17_9 + n8_12_10 + n8_12_11 + n8_12_12 + n8_12_13 + n8_12_14 + n8_12_15 + n8_12_16 + n8_12_17 + n8_12_18 + n8_13_9 + n8_13_8 + n8_13_7 + 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_3_11 + n8_3_12 + n8_3_13 + n8_3_14 + n8_3_15 + n8_3_16 + n8_3_17 + n8_3_18 + n8_18_0 + n8_18_1 + n8_18_2 + n8_18_3 + n8_18_4 + n8_18_5 + n8_18_6 + n8_18_7 + n8_18_8 + n8_18_9 + n8_13_6 + 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_13_5 + n8_17_10 + n8_17_11 + n8_17_12 + n8_17_13 + n8_17_14 + n8_17_15 + n8_17_16 + n8_17_17 + n8_17_18 + n8_13_4 + n8_8_11 + n8_8_12 + n8_8_13 + n8_8_14 + n8_8_15 + n8_8_16 + n8_8_17 + n8_8_18 + n8_13_3 + n8_13_2 + n8_13_1 + 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_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_11_10 + n8_11_11 + n8_11_12 + n8_11_13 + n8_11_14 + n8_11_15 + n8_11_16 + n8_11_17 + n8_11_18 + n8_2_10 + n8_2_11 + n8_2_12 + n8_2_13 + n8_2_14 + n8_2_15 + n8_2_16 + n8_2_17 + n8_2_18 + n8_16_10 + n8_16_11 + n8_16_12 + n8_16_13 + n8_16_14 + n8_16_15 + n8_16_16 + n8_16_17 + n8_16_18 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_7_10 + n8_7_11 + n8_7_12 + n8_7_13 + n8_7_14 + n8_7_15 + n8_7_16 + n8_7_17 + n8_7_18 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_12_9 + n8_12_8 + n8_12_7 + n8_12_6 + n8_12_5 + n8_12_4 + n8_12_3 + n8_12_2 + n8_12_1 + n8_10_11 + n8_10_12 + n8_10_13 + n8_10_14 + n8_10_15 + n8_10_16 + n8_10_17 + n8_10_18 + n8_1_10 + n8_1_11 + n8_1_12 + n8_1_13 + n8_1_14 + n8_1_15 + n8_1_16 + n8_1_17 + n8_1_18 + n8_15_10 + n8_15_11 + n8_15_12 + n8_15_13 + n8_15_14 + n8_15_15 + n8_15_16 + n8_15_17 + n8_15_18 + n8_6_10 + n8_6_11 + n8_6_12 + n8_6_13 + n8_6_14 + n8_6_15 + n8_6_16 + n8_6_17 + n8_6_18 + 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_5_18 + n8_5_17 + n8_5_16 + n8_5_15 + n8_5_14 + n8_5_13 + n8_5_12 + n8_5_11 + n8_11_9 + n8_11_8 + n8_11_7 + n8_11_6 + n8_11_5 + n8_11_4 + n8_11_3 + n8_11_2 + n8_11_1 + n8_0_10 + n8_0_11 + n8_0_12 + n8_0_13 + n8_0_14 + n8_0_15 + n8_0_16 + n8_0_17 + n8_0_18 + n8_14_18 + n8_14_17 + n8_14_16 + n8_14_15 + n8_14_14 + n8_14_13 + n8_14_12 + n8_14_11 + 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) AND ((SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 <= Astart) OR (n7_17_0 + n7_17_1 + n7_17_2 + n7_17_3 + n7_17_4 + n7_17_5 + n7_17_6 + n7_17_7 + n7_17_8 + n7_17_9 + n7_3_10 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_6_0 + n7_15_0 + n7_18_0 + n7_4_10 + n7_7_0 + n7_14_10 + n7_16_10 + n7_8_10 + n7_5_10 + n7_11_10 + n7_10_0 + n7_0_10 + n7_8_0 + n7_12_10 + n7_1_10 + n7_2_10 + n7_13_10 + n7_9_0 + n7_9_9 + n7_9_8 + n7_9_7 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_2_18 + n7_2_17 + n7_2_16 + n7_2_15 + n7_13_11 + n7_13_12 + n7_13_13 + n7_13_14 + n7_13_15 + n7_13_16 + n7_13_17 + n7_13_18 + n7_7_10 + n7_7_11 + n7_7_12 + n7_7_13 + n7_7_14 + n7_7_15 + n7_7_16 + n7_7_17 + n7_7_18 + n7_2_14 + n7_2_13 + n7_2_12 + n7_2_11 + n7_18_10 + n7_18_11 + n7_18_12 + n7_18_13 + n7_18_14 + n7_18_15 + n7_18_16 + n7_18_17 + n7_18_18 + n7_1_11 + n7_1_12 + n7_1_13 + n7_1_14 + n7_1_15 + n7_1_16 + n7_1_17 + n7_1_18 + n7_12_11 + n7_12_12 + n7_12_13 + n7_12_14 + n7_12_15 + n7_12_16 + n7_12_17 + n7_12_18 + n7_6_10 + n7_6_11 + n7_6_12 + n7_6_13 + n7_6_14 + n7_6_15 + n7_6_16 + n7_6_17 + n7_6_18 + 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_17_10 + n7_17_11 + n7_17_12 + n7_17_13 + n7_17_14 + n7_17_15 + n7_17_16 + n7_17_17 + n7_17_18 + n7_0_11 + n7_0_12 + n7_0_13 + n7_0_14 + n7_0_15 + n7_0_16 + n7_0_17 + n7_0_18 + n7_8_18 + n7_8_17 + 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_8_16 + n7_11_11 + n7_11_12 + n7_11_13 + n7_11_14 + n7_11_15 + n7_11_16 + n7_11_17 + n7_11_18 + n7_11_0 + n7_11_1 + n7_11_2 + n7_11_3 + n7_11_4 + n7_11_5 + n7_11_6 + n7_11_7 + n7_11_8 + n7_11_9 + n7_8_15 + n7_5_11 + n7_5_12 + n7_5_13 + n7_5_14 + n7_5_15 + n7_5_16 + n7_5_17 + n7_5_18 + n7_8_14 + n7_8_13 + n7_8_12 + n7_8_11 + 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_14_18 + n7_14_17 + n7_14_16 + n7_14_15 + n7_14_14 + n7_14_13 + n7_12_0 + n7_12_1 + n7_12_2 + n7_12_3 + n7_12_4 + n7_12_5 + n7_12_6 + n7_12_7 + n7_12_8 + n7_12_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_14_12 + n7_16_11 + n7_16_12 + n7_16_13 + n7_16_14 + n7_16_15 + n7_16_16 + n7_16_17 + n7_16_18 + n7_14_11 + n7_7_9 + n7_13_0 + n7_13_1 + n7_13_2 + n7_13_3 + n7_13_4 + n7_13_5 + n7_13_6 + n7_13_7 + n7_13_8 + n7_13_9 + 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_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_18_9 + n7_14_0 + n7_14_1 + n7_14_2 + n7_14_3 + n7_14_4 + n7_14_5 + n7_14_6 + n7_14_7 + n7_14_8 + n7_14_9 + n7_10_10 + n7_10_11 + n7_10_12 + n7_10_13 + n7_10_14 + n7_10_15 + n7_10_16 + n7_10_17 + n7_10_18 + n7_18_8 + n7_4_11 + n7_4_12 + n7_4_13 + n7_4_14 + n7_4_15 + n7_4_16 + n7_4_17 + n7_4_18 + n7_18_7 + 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_18_6 + n7_18_5 + n7_18_4 + n7_18_3 + n7_18_2 + n7_18_1 + n7_15_1 + n7_15_2 + n7_15_3 + n7_15_4 + n7_15_5 + n7_15_6 + n7_15_7 + n7_15_8 + n7_15_9 + 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_6_9 + n7_6_8 + n7_6_7 + n7_6_6 + n7_6_5 + n7_6_4 + n7_6_3 + n7_6_2 + n7_15_10 + n7_15_11 + n7_15_12 + n7_15_13 + n7_15_14 + n7_15_15 + n7_15_16 + n7_15_17 + n7_15_18 + n7_9_10 + n7_9_11 + n7_9_12 + n7_9_13 + n7_9_14 + n7_9_15 + n7_9_16 + n7_9_17 + n7_9_18 + n7_16_0 + n7_16_1 + n7_16_2 + n7_16_3 + n7_16_4 + n7_16_5 + n7_16_6 + n7_16_7 + n7_16_8 + n7_16_9 + n7_6_1 + 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 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10))))) : E (F ((1 <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_9))) : E (F ((3 <= n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9))) : E (F (((2 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18) AND (a5 <= 0) AND ((3 <= CstopAbort) OR (n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= CstopAbort) OR (CstopAbort <= 1))))) : E (F (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 <= 0) AND (a2 + 1 <= AstopAbort) AND ((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + CstopOK_17 + CstopOK_18 + 1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) OR (s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10 + 1 <= n8_14_10 + n8_11_0 + n8_5_10 + n8_0_0 + n8_10_10 + n8_12_0 + n8_1_0 + n8_13_0 + n8_8_10 + n8_7_0 + n8_6_0 + n8_17_0 + n8_2_0 + n8_16_0 + n8_9_10 + n8_18_10 + n8_15_0 + n8_4_10 + n8_3_0 + n8_14_2 + n8_14_3 + n8_14_4 + n8_14_5 + n8_14_6 + n8_14_7 + n8_14_8 + n8_14_9 + n8_13_10 + n8_13_11 + n8_13_12 + n8_13_13 + n8_13_14 + n8_13_15 + n8_13_16 + n8_13_17 + n8_13_18 + n8_14_1 + n8_14_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_3_7 + n8_3_8 + n8_3_9 + n8_4_11 + n8_4_12 + n8_4_13 + n8_4_14 + n8_4_15 + n8_4_16 + n8_4_17 + n8_4_18 + n8_15_1 + n8_15_2 + n8_15_3 + n8_15_4 + n8_15_5 + n8_15_6 + n8_15_7 + n8_15_8 + n8_15_9 + n8_4_0 + n8_4_1 + n8_4_2 + n8_4_3 + n8_4_4 + n8_4_5 + n8_4_6 + n8_4_7 + n8_4_8 + n8_4_9 + n8_18_11 + n8_18_12 + n8_18_13 + n8_18_14 + n8_18_15 + n8_18_16 + n8_18_17 + n8_18_18 + n8_9_11 + n8_9_12 + n8_9_13 + n8_9_14 + n8_9_15 + n8_9_16 + n8_9_17 + n8_9_18 + n8_16_1 + n8_16_2 + n8_16_3 + n8_16_4 + n8_16_5 + n8_16_6 + n8_16_7 + n8_16_8 + n8_16_9 + n8_5_0 + n8_5_1 + n8_5_2 + n8_5_3 + n8_5_4 + n8_5_5 + n8_5_6 + n8_5_7 + n8_5_8 + n8_5_9 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_17_1 + n8_17_2 + n8_17_3 + n8_17_4 + n8_17_5 + n8_17_6 + n8_17_7 + n8_17_8 + n8_17_9 + n8_12_10 + n8_12_11 + n8_12_12 + n8_12_13 + n8_12_14 + n8_12_15 + n8_12_16 + n8_12_17 + n8_12_18 + n8_13_9 + n8_13_8 + n8_13_7 + 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_3_11 + n8_3_12 + n8_3_13 + n8_3_14 + n8_3_15 + n8_3_16 + n8_3_17 + n8_3_18 + n8_18_0 + n8_18_1 + n8_18_2 + n8_18_3 + n8_18_4 + n8_18_5 + n8_18_6 + n8_18_7 + n8_18_8 + n8_18_9 + n8_13_6 + 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_13_5 + n8_17_10 + n8_17_11 + n8_17_12 + n8_17_13 + n8_17_14 + n8_17_15 + n8_17_16 + n8_17_17 + n8_17_18 + n8_13_4 + n8_8_11 + n8_8_12 + n8_8_13 + n8_8_14 + n8_8_15 + n8_8_16 + n8_8_17 + n8_8_18 + n8_13_3 + n8_13_2 + n8_13_1 + 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_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_11_10 + n8_11_11 + n8_11_12 + n8_11_13 + n8_11_14 + n8_11_15 + n8_11_16 + n8_11_17 + n8_11_18 + n8_2_10 + n8_2_11 + n8_2_12 + n8_2_13 + n8_2_14 + n8_2_15 + n8_2_16 + n8_2_17 + n8_2_18 + n8_16_10 + n8_16_11 + n8_16_12 + n8_16_13 + n8_16_14 + n8_16_15 + n8_16_16 + n8_16_17 + n8_16_18 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_7_10 + n8_7_11 + n8_7_12 + n8_7_13 + n8_7_14 + n8_7_15 + n8_7_16 + n8_7_17 + n8_7_18 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_12_9 + n8_12_8 + n8_12_7 + n8_12_6 + n8_12_5 + n8_12_4 + n8_12_3 + n8_12_2 + n8_12_1 + n8_10_11 + n8_10_12 + n8_10_13 + n8_10_14 + n8_10_15 + n8_10_16 + n8_10_17 + n8_10_18 + n8_1_10 + n8_1_11 + n8_1_12 + n8_1_13 + n8_1_14 + n8
_1_15 + n8_1_16 + n8_1_17 + n8_1_18 + n8_15_10 + n8_15_11 + n8_15_12 + n8_15_13 + n8_15_14 + n8_15_15 + n8_15_16 + n8_15_17 + n8_15_18 + n8_6_10 + n8_6_11 + n8_6_12 + n8_6_13 + n8_6_14 + n8_6_15 + n8_6_16 + n8_6_17 + n8_6_18 + 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_5_18 + n8_5_17 + n8_5_16 + n8_5_15 + n8_5_14 + n8_5_13 + n8_5_12 + n8_5_11 + n8_11_9 + n8_11_8 + n8_11_7 + n8_11_6 + n8_11_5 + n8_11_4 + n8_11_3 + n8_11_2 + n8_11_1 + n8_0_10 + n8_0_11 + n8_0_12 + n8_0_13 + n8_0_14 + n8_0_15 + n8_0_16 + n8_0_17 + n8_0_18 + n8_14_18 + n8_14_17 + n8_14_16 + n8_14_15 + n8_14_14 + n8_14_13 + n8_14_12 + n8_14_11 + 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))))) : E (F ((((n7_16_6 + 1 <= n9_5_3) OR (n8_8_9 + 1 <= CstopOK_11)) AND ((2 <= n8_16_3) OR (n8_0_1 <= n9_18_16) OR (n9_16_4 <= n7_10_7) OR (n7_3_10 <= n7_0_17))))) : A (G (((n7_11_4 <= n7_12_11) AND ((n8_13_11 <= 1) OR (n8_1_9 <= 2))))) : A (G (((n7_1_1 <= n8_1_7) AND (n7_4_5 <= Sstart_12)))) : A (G (((n9_8_3 <= 2) AND (n9_6_3 <= 2) AND (n9_16_5 <= 0)))) : E (F (((n8_16_13 <= 1) AND ((3 <= n8_4_9) OR (2 <= n7_14_4)) AND (s3_3 <= c1_10) AND (3 <= s3_9) AND (n8_5_1 <= n9_0_1)))) : A (G (((n9_7_14 <= n8_0_14) OR (n9_8_16 + 1 <= n1_5)))) : E (F (((n9_17_17 <= n8_0_8) AND ((3 <= n9_1_7) OR (n9_0_8 <= n7_8_12)) AND ((2 <= n8_9_10) OR (1 <= n7_16_11) OR ((1 <= Sstart_7) AND (2 <= n8_5_11)))))) : E (F (((n5_7 + 1 <= n7_0_9) AND (n8_16_12 + 1 <= n7_2_8) AND (2 <= n8_3_9))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= a4)))
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 1180 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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SstopOK_10 + SstopOK_11 + SstopOK_12 + SstopOK_13 + SstopOK_14 + SstopOK_15 + SstopOK_16 + SstopOK_17 + SstopOK_18 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_0 + SstopOK_1 + SstopOK_6 + SstopOK_7 + 1 <= a2) OR (s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_18 + s2_17 + s2_16 + s2_15 + s2_14 + s2_13 + s2_12 + s2_11 + s2_10 +... (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 1180 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 not invariant.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((AstopOK <= n7_17_0 + n7_17_1 + n7_17_2 + n7_17_3 + n7_17_4 + n7_17_5 + n7_17_6 + n7_17_7 + n7_17_8 + n7_17_9 + n7_3_10 + n7_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_6_0 + n7_15_0 + n7_18_0 + n7_4_10 + n7_7_0 + n7_14_10 + n7_16_10 + n7_8_10 + n7_5_10 + n7_11_10 + n7_10_0 + n7_0_10 + n7_8_0 + n7_12_10 + n7_1_10 + n7_2_10 + n7_13_10 + n7_9_0 + n7_9_9 + 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 1180 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-18-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 102 markings, 101 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Astart <= 0) AND (a3 + 1 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10) AND (2 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) AND (2 <= n8_14_10 + n8_11_0 + n8_5_10 + n8_0_0 + n8_10_10 + n8_12_0 + n... (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 1180 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 158501 markings, 372673 edges, 31700 markings/sec, 0 secs
lola: sara is running 5 secs || 323427 markings, 791072 edges, 32985 markings/sec, 5 secs
lola: sara is running 10 secs || 498705 markings, 1284960 edges, 35056 markings/sec, 10 secs
lola: sara is running 15 secs || 637065 markings, 2018389 edges, 27672 markings/sec, 15 secs
lola: sara is running 20 secs || 765189 markings, 2576401 edges, 25625 markings/sec, 20 secs
lola: sara is running 25 secs || 897392 markings, 3189007 edges, 26441 markings/sec, 25 secs
lola: sara is running 30 secs || 1019886 markings, 3775847 edges, 24499 markings/sec, 30 secs
lola: sara is running 35 secs || 1164642 markings, 4492336 edges, 28951 markings/sec, 35 secs
lola: sara is running 40 secs || 1289634 markings, 5167903 edges, 24998 markings/sec, 40 secs
lola: sara is running 45 secs || 1446254 markings, 5636903 edges, 31324 markings/sec, 45 secs
lola: sara is running 50 secs || 1617785 markings, 6117468 edges, 34306 markings/sec, 50 secs
lola: sara is running 55 secs || 1780951 markings, 6606322 edges, 32633 markings/sec, 55 secs
lola: sara is running 60 secs || 1950756 markings, 7167304 edges, 33961 markings/sec, 60 secs
lola: sara is running 65 secs || 2102957 markings, 8136768 edges, 30440 markings/sec, 65 secs
lola: sara is running 70 secs || 2226616 markings, 8866488 edges, 24732 markings/sec, 70 secs
lola: sara is running 75 secs || 2351364 markings, 9660947 edges, 24950 markings/sec, 75 secs
lola: sara is running 80 secs || 2487752 markings, 10488618 edges, 27278 markings/sec, 80 secs
lola: sara is running 85 secs || 2618850 markings, 11172400 edges, 26220 markings/sec, 85 secs
lola: sara is running 90 secs || 2732837 markings, 11841748 edges, 22797 markings/sec, 90 secs
lola: sara is running 95 secs || 2897288 markings, 12718303 edges, 32890 markings/sec, 95 secs
lola: sara is running 100 secs || 2997651 markings, 13614424 edges, 20073 markings/sec, 100 secs
lola: sara is running 105 secs || 3099318 markings, 14570461 edges, 20333 markings/sec, 105 secs
lola: sara is running 110 secs || 3215763 markings, 15336936 edges, 23289 markings/sec, 110 secs
lola: sara is running 115 secs || 3324967 markings, 15912044 edges, 21841 markings/sec, 115 secs
lola: sara is running 120 secs || 3433590 markings, 16459582 edges, 21725 markings/sec, 120 secs
lola: sara is running 125 secs || 3552030 markings, 17110070 edges, 23688 markings/sec, 125 secs
lola: sara is running 130 secs || 3675354 markings, 17760198 edges, 24665 markings/sec, 130 secs
lola: sara is running 135 secs || 3795471 markings, 18435054 edges, 24023 markings/sec, 135 secs
lola: sara is running 140 secs || 3948643 markings, 19292818 edges, 30634 markings/sec, 140 secs
lola: sara is running 145 secs || 4086760 markings, 20015123 edges, 27623 markings/sec, 145 secs
lola: sara is running 150 secs || 4251079 markings, 20874178 edges, 32864 markings/sec, 150 secs
lola: sara is running 155 secs || 4386897 markings, 21816968 edges, 27164 markings/sec, 155 secs
lola: sara is running 160 secs || 4492589 markings, 22743582 edges, 21138 markings/sec, 160 secs
lola: sara is running 165 secs || 4590159 markings, 23711998 edges, 19514 markings/sec, 165 secs
lola: sara is running 170 secs || 4757297 markings, 24568435 edges, 33428 markings/sec, 170 secs
lola: sara is running 175 secs || 4908841 markings, 25448648 edges, 30309 markings/sec, 175 secs
lola: sara is running 180 secs || 5028635 markings, 26507827 edges, 23959 markings/sec, 180 secs
lola: sara is running 185 secs || 5130300 markings, 27614267 edges, 20333 markings/sec, 185 secs
lola: sara is running 190 secs || 5218581 markings, 28601692 edges, 17656 markings/sec, 190 secs
lola: sara is running 195 secs || 5301035 markings, 29649182 edges, 16491 markings/sec, 195 secs
lola: sara is running 200 secs || 5532922 markings, 30245288 edges, 46377 markings/sec, 200 secs
lola: sara is running 205 secs || 5703397 markings, 31014343 edges, 34095 markings/sec, 205 secs
lola: sara is running 210 secs || 5871994 markings, 31819501 edges, 33719 markings/sec, 210 secs
lola: sara is running 215 secs || 6072829 markings, 32493822 edges, 40167 markings/sec, 215 secs
lola: sara is running 220 secs || 6271586 markings, 33177566 edges, 39751 markings/sec, 220 secs
lola: sara is running 225 secs || 6431564 markings, 34043916 edges, 31996 markings/sec, 225 secs
lola: sara is running 230 secs || 6571561 markings, 34899727 edges, 27999 markings/sec, 230 secs
lola: sara is running 235 secs || 6702849 markings, 36003716 edges, 26258 markings/sec, 235 secs
lola: sara is running 240 secs || 6887651 markings, 36921617 edges, 36960 markings/sec, 240 secs
lola: sara is running 245 secs || 7062474 markings, 37840510 edges, 34965 markings/sec, 245 secs
lola: sara is running 250 secs || 7231728 markings, 38776787 edges, 33851 markings/sec, 250 secs
lola: sara is running 255 secs || 7376975 markings, 39845131 edges, 29049 markings/sec, 255 secs
lola: sara is running 260 secs || 7524154 markings, 40819129 edges, 29436 markings/sec, 260 secs
lola: sara is running 265 secs || 7636951 markings, 42052281 edges, 22559 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_18 + c1_17 + c1_16 + c1_15 + c1_14 + c1_13 + c1_12 + c1_11 + c1_10 + c1_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 1180 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: 83 markings, 82 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= n2_18 + n2_17 + n2_16 + n2_15 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_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 1180 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-18-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 + n3_11 + n3_12 + n3_13 + n3_14 + n3_15 + n3_16 + n3_17 + n3_18) AND (a5 <= 0) AND ((3 <= CstopAbort) OR (n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= CstopAbort) OR (CstopAbort <= 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 1180 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 <= 0) AND (a2 + 1 <= AstopAbort) AND ((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 + CstopOK_11 + CstopOK_12 + CstopOK_13 + CstopOK_14 + CstopOK_15 + CstopOK_16 + Cs... (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 1180 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: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityCardinality-7.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 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((n7_16_6 + 1 <= n9_5_3) OR (n8_8_9 + 1 <= CstopOK_11)) AND ((2 <= n8_16_3) OR (n8_0_1 <= n9_18_16) OR (n9_16_4 <= n7_10_7) OR (n7_3_10 <= n7_0_17)))))
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 1180 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 16 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 104 markings, 103 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n7_11_4 <= n7_12_11) AND ((n8_13_11 <= 1) OR (n8_1_9 <= 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 1180 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-9.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: 46 markings, 45 edges
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n7_1_1 <= n8_1_7) AND (n7_4_5 <= Sstart_12))))
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 1180 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n9_8_3 <= 2) AND (n9_6_3 <= 2) AND (n9_16_5 <= 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 1180 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 3 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 107 markings, 106 edges
lola: ========================================
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n8_16_13 <= 1) AND ((3 <= n8_4_9) OR (2 <= n7_14_4)) AND (s3_3 <= c1_10) AND (3 <= s3_9) AND (n8_5_1 <= n9_0_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 1180 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 2 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityCardinality-12.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 13 will run for 1087 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((n9_7_14 <= n8_0_14) OR (n9_8_16 + 1 <= n1_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 1180 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-18-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 104 markings, 103 edges
lola: ========================================
lola: subprocess 14 will run for 1630 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n9_17_17 <= n8_0_8) AND ((3 <= n9_1_7) OR (n9_0_8 <= n7_8_12)) AND ((2 <= n8_9_10) OR (1 <= n7_16_11) OR ((1 <= Sstart_7) AND (2 <= n8_5_11))))))
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 1180 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 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-18-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: subprocess 15 will run for 3261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((n5_7 + 1 <= n7_0_9) AND (n8_16_12 + 1 <= n7_2_8) AND (2 <= n8_3_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 1180 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 QuasiCertifProtocol-PT-18-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-18-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no no no unknown yes yes yes no yes no no no no no yes no
lola: ========================================
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-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/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is QuasiCertifProtocol-PT-18, 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 r143-qhx2-152673584400082"
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 ;