Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r104-oct2-155272226500818.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Philosophers-PT-000050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226500818
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 23K Feb 12 04:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 12 04:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 8 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 8 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 9.9K Feb 5 00:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 5 00:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 205K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552820823891

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Philosophers-PT-000050 @ 3570 seconds

FORMULA Philosophers-PT-000050-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-PT-000050-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3541
rslt: Output for ReachabilityCardinality @ Philosophers-PT-000050

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun Mar 17 11:07:03 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((Eat_6 <= 0)))",
"processed_size": 20,
"rewrites": 20
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((Catch2_3 + 1 <= Eat_23)))",
"processed_size": 32,
"rewrites": 19
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "E (F (((Think_42 <= Eat_40) AND (Fork_48 <= Catch1_24) AND (Fork_36 <= Think_29) AND (Fork_27 <= Catch2_19) AND ((1 <= Catch1_18) OR (Eat_9 <= Fork_2) OR (Think_44 <= Fork_19)))))",
"processed_size": 181,
"rewrites": 19
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 150,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "E (F (((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) AND (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1))))",
"processed_size": 1542,
"rewrites": 19
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "A (G (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50) OR (1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50))))",
"processed_size": 1155,
"rewrites": 20
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "E (F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1)))",
"processed_size": 940,
"rewrites": 19
},
"result":
{
"edges": 47,
"markings": 48,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "A (G ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50)))",
"processed_size": 940,
"rewrites": 20
},
"result":
{
"edges": 48,
"markings": 49,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 250,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 150,
"visible_transitions": 0
},
"processed": "A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) OR (Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + 1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) OR (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))))",
"processed_size": 2633,
"rewrites": 20
},
"result":
{
"edges": 344,
"markings": 256,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 200,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 200,
"visible_transitions": 0
},
"processed": "E (F (((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))))",
"processed_size": 2179,
"rewrites": 19
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 350,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 250,
"visible_transitions": 0
},
"processed": "A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 + 1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 + 1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) AND ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 <= 1) OR (Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50)))))",
"processed_size": 3730,
"rewrites": 20
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28364,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : FALSE : E(F(**)) : E(F(**)) : TRUE : TRUE : A(G(**)) : FALSE : FALSE"
},
"net":
{
"arcs": 800,
"conflict_clusters": 51,
"places": 250,
"places_significant": 150,
"singleton_clusters": 0,
"transitions": 250
},
"result":
{
"preliminary_value": "yes yes no yes no yes no no no yes yes yes yes no no no ",
"value": "yes yes no yes no yes no no no yes yes yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 500/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 250 transitions, 150 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= Catch2_23)
lola: LP says that atomic proposition is always false: (2 <= Eat_5)
lola: LP says that atomic proposition is always false: (3 <= Fork_17)
lola: LP says that atomic proposition is always false: (3 <= Fork_34)
lola: LP says that atomic proposition is always false: (2 <= Catch1_17)
lola: LP says that atomic proposition is always false: (3 <= Fork_16)
lola: LP says that atomic proposition is always false: (2 <= Catch1_18)
lola: LP says that atomic proposition is always false: (2 <= Catch2_49)
lola: LP says that atomic proposition is always false: (2 <= Think_4)
lola: LP says that atomic proposition is always false: (3 <= Eat_34)
lola: LP says that atomic proposition is always false: (2 <= Catch1_41)
lola: LP says that atomic proposition is always false: (3 <= Catch1_20)
lola: LP says that atomic proposition is always false: (3 <= Think_23)
lola: LP says that atomic proposition is always false: (3 <= Fork_47)
lola: LP says that atomic proposition is always false: (2 <= Think_20)
lola: A (G ((0 <= 0))) : E (F (((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) AND (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1)))) : A (G (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50) OR (1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50)))) : E (F (((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50)))) : A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 + 1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 + 1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) AND ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 <= 1) OR (Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))))) : E (F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1))) : A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) OR (Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + 1 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) OR (3 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50)))) : A (G ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50))) : E (F (())) : E (F (((Think_42 <= Eat_40) AND (Fork_48 <= Catch1_24) AND (Fork_36 <= Think_29) AND (Fork_27 <= Catch2_19) AND ((1 <= Catch1_18) OR (Eat_9 <= Fork_2) OR (Think_44 <= Fork_19))))) : E (F ((Catch2_3 + 1 <= Eat_23))) : A (G (())) : A (G (())) : A (G ((Eat_6 <= 0))) : E (F (())) : E (F ((2 <= Think_20)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 18 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Eat_6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((Eat_6 <= 0)))
lola: processed formula length: 20
lola: 20 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= Eat_6)
lola: state equation task get result unparse finished id 0
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Catch2_3 + 1 <= Eat_23)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Catch2_3 + 1 <= Eat_23)))
lola: processed formula length: 32
lola: 19 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Catch2_3 + 1 <= Eat_23)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Think_42 <= Eat_40) AND (Fork_48 <= Catch1_24) AND (Fork_36 <= Think_29) AND (Fork_27 <= Catch2_19) AND ((1 <= Catch1_18) OR (Eat_9 <= Fork_2) OR (Think_44 <= Fork_19)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Think_42 <= Eat_40) AND (Fork_48 <= Catch1_24) AND (Fork_36 <= Think_29) AND (Fork_27 <= Catch2_19) AND ((1 <= Catch1_18) OR (Eat_9 <= Fork_2) OR (Think_44 <= Fork_19)))))
lola: processed formula length: 181
lola: 19 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Think_42 <= Eat_40) AND (Fork_48 <= Catch1_24) AND (Fork_36 <= Think_29) AND (Fork_27 <= Catch2_19) AND ((1 <= Catch1_18) OR (Eat_9 <= Fork_2) OR (Think_44 <= Fork_19)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + ... (shortened)
lola: processed formula length: 1542
lola: 19 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50) AND (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + ... (shortened)
lola: processed formula length: 1155
lola: 20 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 <= 0) AND (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fo... (shortened)
lola: processed formula length: 940
lola: 19 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1)
lola: state equation task get result unparse finished id 0
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: 48 markings, 47 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + ... (shortened)
lola: processed formula length: 940
lola: 20 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 + 1 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 49 markings, 48 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch... (shortened)
lola: processed formula length: 2633
lola: 20 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + 1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50) AND (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) AND (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 256 markings, 344 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think... (shortened)
lola: processed formula length: 2179
lola: 19 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) AND (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch... (shortened)
lola: processed formula length: 3730
lola: 20 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 + Fork_21 + Fork_22 + Fork_23 + Fork_24 + Fork_25 + Fork_26 + Fork_27 + Fork_28 + Fork_29 + Fork_30 + Fork_31 + Fork_32 + Fork_33 + Fork_34 + Fork_35 + Fork_36 + Fork_37 + Fork_38 + Fork_39 + Fork_40 + Fork_41 + Fork_42 + Fork_43 + Fork_44 + Fork_45 + Fork_46 + Fork_47 + Fork_48 + Fork_49 + Fork_50 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50) OR (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 + Think_21 + Think_22 + Think_23 + Think_24 + Think_25 + Think_26 + Think_27 + Think_28 + Think_29 + Think_30 + Think_31 + Think_32 + Think_33 + Think_34 + Think_35 + Think_36 + Think_37 + Think_38 + Think_39 + Think_40 + Think_41 + Think_42 + Think_43 + Think_44 + Think_45 + Think_46 + Think_47 + Think_48 + Think_49 + Think_50 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 + Catch1_21 + Catch1_22 + Catch1_23 + Catch1_24 + Catch1_25 + Catch1_26 + Catch1_27 + Catch1_28 + Catch1_29 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_46 + Catch1_47 + Catch1_48 + Catch1_49 + Catch1_50) OR ((2 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1) AND (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 + Catch2_21 + Catch2_22 + Catch2_23 + Catch2_24 + Catch2_25 + Catch2_26 + Catch2_27 + Catch2_28 + Catch2_29 + Catch2_30 + Catch2_31 + Catch2_32 + Catch2_33 + Catch2_34 + Catch2_35 + Catch2_36 + Catch2_37 + Catch2_38 + Catch2_39 + Catch2_40 + Catch2_41 + Catch2_42 + Catch2_43 + Catch2_44 + Catch2_45 + Catch2_46 + Catch2_47 + Catch2_48 + Catch2_49 + Catch2_50 <= Eat_50 + Eat_49 + Eat_48 + Eat_47 + Eat_46 + Eat_45 + Eat_44 + Eat_43 + Eat_42 + Eat_41 + Eat_40 + Eat_39 + Eat_38 + Eat_37 + Eat_36 + Eat_35 + Eat_34 + Eat_33 + Eat_11 + Eat_12 + Eat_13 + Eat_14 + Eat_15 + Eat_16 + Eat_17 + Eat_18 + Eat_19 + Eat_20 + Eat_21 + Eat_22 + Eat_23 + Eat_24 + Eat_25 + Eat_26 + Eat_27 + Eat_28 + Eat_29 + Eat_30 + Eat_31 + Eat_32 + Eat_10 + Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 26 markings, 25 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes no no no yes yes yes yes no no no
lola:
preliminary result: yes yes no yes no yes no no no yes yes yes yes no no no
lola: memory consumption: 28364 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552820852365

--------------------
content from 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="Philosophers-PT-000050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is Philosophers-PT-000050, 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 r104-oct2-155272226500818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 execution
cd execution
if [ "ReachabilityCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;