Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r027-smll-155225120900161.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is CircadianClock-PT-100000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-155225120900161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.4K Feb 9 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 9 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 5 07:18 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 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 23:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K Feb 4 23:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.1K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 2 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Jan 29 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jan 29 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 11K 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 CircadianClock-PT-100000-ReachabilityCardinality-00
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-01
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-02
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-03
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-04
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-05
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-06
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-07
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-08
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-09
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-10
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-11
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-12
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-13
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-14
FORMULA_NAME CircadianClock-PT-100000-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552535991700

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ CircadianClock-PT-100000 @ 3570 seconds

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-100000-ReachabilityCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2155
rslt: Output for ReachabilityCardinality @ CircadianClock-PT-100000

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 14 03:59:51 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": "FALSE",
"processed_size": 5,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"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": 9
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 9
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((2 <= c_cap) AND (c_cap <= 1))))",
"processed_size": 39,
"rewrites": 10
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 297
},
"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 ((1 <= c_cap)))",
"processed_size": 20,
"rewrites": 11
},
"result":
{
"edges": 300002,
"markings": 300003,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((2 <= c_cap))))",
"processed_size": 22,
"rewrites": 11
},
"result":
{
"edges": 299999,
"markings": 300000,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 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 ((3 <= mr_cap)))",
"processed_size": 21,
"rewrites": 11
},
"result":
{
"edges": 99998,
"markings": 99999,
"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": 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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((c <= mr_cap)))",
"processed_size": 21,
"rewrites": 11
},
"result":
{
"edges": 100009,
"markings": 100007,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "A (G (((c <= mr_cap))))",
"processed_size": 23,
"rewrites": 11
},
"result":
{
"edges": 100009,
"markings": 100007,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((mr_cap <= 0) OR (r_cap <= da_a))))",
"processed_size": 43,
"rewrites": 10
},
"result":
{
"edges": 100000,
"markings": 100001,
"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": 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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= da) AND (ma_cap <= c))))",
"processed_size": 37,
"rewrites": 10
},
"result":
{
"edges": 100000,
"markings": 100001,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 718
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((da + 1 <= mr) OR (a <= a_cap))))",
"processed_size": 41,
"rewrites": 11
},
"result":
{
"edges": 50002,
"markings": 50003,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 958
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G (((a <= 1) OR (a <= 1) OR (((ma <= c_cap) OR (a_cap <= mr)) AND (a <= c_cap)))))",
"processed_size": 88,
"rewrites": 11
},
"result":
{
"edges": 200064,
"markings": 200031,
"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": 7,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((r_cap <= 2) AND ((3 <= ma) OR (da <= c_cap)) AND (c <= mr_cap))))",
"processed_size": 74,
"rewrites": 10
},
"result":
{
"edges": 99999,
"markings": 100000,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2875
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G ((((c <= da_a) OR (1 <= c_cap)) AND ((1 <= ma_cap) OR (ma <= r_cap)) AND ((da <= mr_cap) OR (1 <= dr) OR (2 <= r) OR (da_a <= a)))))",
"processed_size": 142,
"rewrites": 11
},
"result":
{
"edges": 100003,
"markings": 100003,
"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": 8,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 21600,
"runtime": 1415.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : FALSE : E(F(**)) : E(F(**)) : FALSE : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : FALSE : A(G(**))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no unknown yes no no yes yes no no no no no no no no ",
"value": "no no unknown yes no no yes yes no no no no no 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: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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: (3 <= dr_a)
lola: LP says that atomic proposition is always false: (3 <= dr)
lola: LP says that atomic proposition is always false: (2 <= da)
lola: LP says that atomic proposition is always false: (2 <= da_a)
lola: A (G ((3 <= mr_cap))) : E (F ((3 <= dr_a))) : E (F (((r <= 2) AND (mr <= 1) AND (mr_cap <= a)))) : E (F (((r_cap <= 2) AND ((3 <= ma) OR (da <= c_cap)) AND (c <= mr_cap)))) : E (F (())) : A (G ((c <= mr_cap))) : E (F (((1 <= da) AND (ma_cap <= c)))) : E (F (((mr_cap <= 0) OR (r_cap <= da_a)))) : A (G (((c <= mr_cap)))) : A (G (((da + 1 <= mr) OR (a <= a_cap)))) : E (F (((2 <= c_cap) AND (c_cap <= 1)))) : A (G ((1 <= c_cap))) : A (G ((((c <= da_a) OR (1 <= c_cap)) AND ((1 <= ma_cap) OR (ma <= r_cap)) AND ((da <= mr_cap) OR (1 <= dr) OR (2 <= r) OR (da_a <= a))))) : A (G (((2 <= c_cap)))) : E (F (())) : A (G (((a <= 1) OR (a <= 1) OR (((ma <= c_cap) OR (a_cap <= mr)) AND (a <= c_cap)))))
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: 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 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 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: 9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 9 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= c_cap) AND (c_cap <= 1))))
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 (((2 <= c_cap) AND (c_cap <= 1))))
lola: processed formula length: 39
lola: 10 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: ((2 <= c_cap) AND (c_cap <= 1))
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= c_cap)))
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 <= c_cap)))
lola: processed formula length: 20
lola: 11 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: (c_cap <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 300003 markings, 300002 edges
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= c_cap))))
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 (((2 <= c_cap))))
lola: processed formula length: 22
lola: 11 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: ========================================
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: ((c_cap <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 300000 markings, 299999 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= mr_cap)))
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 ((3 <= mr_cap)))
lola: processed formula length: 21
lola: 11 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: (mr_cap <= 2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 99999 markings, 99998 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((c <= mr_cap)))
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 ((c <= mr_cap)))
lola: processed formula length: 21
lola: 11 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: (mr_cap + 1 <= c)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100007 markings, 100009 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((c <= mr_cap))))
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 (((c <= mr_cap))))
lola: processed formula length: 23
lola: 11 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: ((mr_cap + 1 <= c))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100007 markings, 100009 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((mr_cap <= 0) OR (r_cap <= da_a))))
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 (((mr_cap <= 0) OR (r_cap <= da_a))))
lola: processed formula length: 43
lola: 10 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: ((mr_cap <= 0) OR (r_cap <= da_a))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= da) AND (ma_cap <= c))))
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 (((1 <= da) AND (ma_cap <= c))))
lola: processed formula length: 37
lola: 10 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: ((1 <= da) AND (ma_cap <= c))
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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100001 markings, 100000 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((r <= 2) AND (mr <= 1) AND (mr_cap <= a))))
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 (((r <= 2) AND (mr <= 1) AND (mr_cap <= a))))
lola: processed formula length: 50
lola: 10 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: ((r <= 2) AND (mr <= 1) AND (mr_cap <= a))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 2254063 markings, 4577230 edges, 450813 markings/sec, 0 secs
lola: sara is running 5 secs || 4154483 markings, 8662563 edges, 380084 markings/sec, 5 secs
lola: sara is running 10 secs || 5952336 markings, 12709256 edges, 359571 markings/sec, 10 secs
lola: sara is running 15 secs || 7596165 markings, 16335972 edges, 328766 markings/sec, 15 secs
lola: sara is running 20 secs || 9458663 markings, 20373702 edges, 372500 markings/sec, 20 secs
lola: sara is running 25 secs || 11238499 markings, 24340863 edges, 355967 markings/sec, 25 secs
lola: sara is running 30 secs || 13017648 markings, 28275128 edges, 355830 markings/sec, 30 secs
lola: sara is running 35 secs || 14788315 markings, 32135485 edges, 354133 markings/sec, 35 secs
lola: sara is running 40 secs || 16532179 markings, 35989554 edges, 348773 markings/sec, 40 secs
lola: sara is running 45 secs || 18325004 markings, 39927809 edges, 358565 markings/sec, 45 secs
lola: sara is running 50 secs || 20043551 markings, 43696806 edges, 343709 markings/sec, 50 secs
lola: sara is running 55 secs || 21778199 markings, 47529930 edges, 346930 markings/sec, 55 secs
lola: sara is running 60 secs || 23435008 markings, 51186148 edges, 331362 markings/sec, 60 secs
lola: sara is running 65 secs || 25198947 markings, 54990356 edges, 352788 markings/sec, 65 secs
lola: sara is running 70 secs || 26893126 markings, 58772364 edges, 338836 markings/sec, 70 secs
lola: sara is running 75 secs || 28577000 markings, 62490095 edges, 336775 markings/sec, 75 secs
lola: sara is running 80 secs || 30267881 markings, 66223748 edges, 338176 markings/sec, 80 secs
lola: sara is running 85 secs || 31959051 markings, 69868867 edges, 338234 markings/sec, 85 secs
lola: sara is running 90 secs || 33701962 markings, 73755336 edges, 348582 markings/sec, 90 secs
lola: sara is running 95 secs || 35419985 markings, 77550677 edges, 343605 markings/sec, 95 secs
lola: sara is running 100 secs || 37178395 markings, 81325498 edges, 351682 markings/sec, 100 secs
lola: sara is running 105 secs || 38844331 markings, 85060141 edges, 333187 markings/sec, 105 secs
lola: sara is running 110 secs || 40504262 markings, 88723454 edges, 331986 markings/sec, 110 secs
lola: sara is running 115 secs || 42209899 markings, 92490645 edges, 341127 markings/sec, 115 secs
lola: sara is running 120 secs || 43912174 markings, 96125035 edges, 340455 markings/sec, 120 secs
lola: sara is running 125 secs || 45539369 markings, 99784480 edges, 325439 markings/sec, 125 secs
lola: sara is running 130 secs || 47172740 markings, 103387431 edges, 326674 markings/sec, 130 secs
lola: sara is running 135 secs || 48859502 markings, 107111722 edges, 337352 markings/sec, 135 secs
lola: sara is running 140 secs || 50551758 markings, 110848504 edges, 338451 markings/sec, 140 secs
lola: sara is running 145 secs || 52231160 markings, 114479793 edges, 335880 markings/sec, 145 secs
lola: sara is running 150 secs || 53881972 markings, 118144031 edges, 330162 markings/sec, 150 secs
lola: sara is running 155 secs || 55500570 markings, 121713407 edges, 323720 markings/sec, 155 secs
lola: sara is running 160 secs || 57153343 markings, 125360451 edges, 330555 markings/sec, 160 secs
lola: sara is running 165 secs || 58779294 markings, 128946538 edges, 325190 markings/sec, 165 secs
lola: sara is running 170 secs || 60445411 markings, 132520346 edges, 333223 markings/sec, 170 secs
lola: sara is running 175 secs || 62035549 markings, 136073976 edges, 318028 markings/sec, 175 secs
lola: sara is running 180 secs || 63653058 markings, 139640874 edges, 323502 markings/sec, 180 secs
lola: sara is running 185 secs || 65325822 markings, 143333356 edges, 334553 markings/sec, 185 secs
lola: sara is running 190 secs || 67018344 markings, 147070738 edges, 338504 markings/sec, 190 secs
lola: sara is running 195 secs || 68716131 markings, 150730307 edges, 339557 markings/sec, 195 secs
lola: sara is running 200 secs || 70362251 markings, 154397387 edges, 329224 markings/sec, 200 secs
lola: sara is running 205 secs || 72012357 markings, 158038369 edges, 330021 markings/sec, 205 secs
lola: sara is running 210 secs || 73686993 markings, 161735102 edges, 334927 markings/sec, 210 secs
lola: sara is running 215 secs || 75344814 markings, 165356891 edges, 331564 markings/sec, 215 secs
lola: sara is running 220 secs || 76978144 markings, 168914147 edges, 326666 markings/sec, 220 secs
lola: sara is running 225 secs || 78588610 markings, 172492745 edges, 322093 markings/sec, 225 secs
lola: sara is running 230 secs || 80177063 markings, 175993608 edges, 317691 markings/sec, 230 secs
lola: sara is running 235 secs || 81851747 markings, 179690453 edges, 334937 markings/sec, 235 secs
lola: sara is running 240 secs || 83486403 markings, 183296323 edges, 326931 markings/sec, 240 secs
lola: sara is running 245 secs || 85164688 markings, 186878351 edges, 335657 markings/sec, 245 secs
lola: sara is running 250 secs || 86746908 markings, 190417840 edges, 316444 markings/sec, 250 secs
lola: sara is running 255 secs || 88312725 markings, 193882837 edges, 313163 markings/sec, 255 secs
lola: sara is running 260 secs || 89942142 markings, 197476802 edges, 325883 markings/sec, 260 secs
lola: sara is running 265 secs || 91524926 markings, 200964780 edges, 316557 markings/sec, 265 secs
lola: sara is running 270 secs || 93113534 markings, 204465995 edges, 317722 markings/sec, 270 secs
lola: sara is running 275 secs || 94682768 markings, 207923179 edges, 313847 markings/sec, 275 secs
lola: sara is running 280 secs || 96273843 markings, 211430003 edges, 318215 markings/sec, 280 secs
lola: sara is running 285 secs || 97971653 markings, 215089074 edges, 339562 markings/sec, 285 secs
lola: sara is running 290 secs || 99598527 markings, 218712962 edges, 325375 markings/sec, 290 secs
lola: sara is running 295 secs || 101222316 markings, 222294136 edges, 324758 markings/sec, 295 secs
lola: sara is running 300 secs || 102837745 markings, 225856307 edges, 323086 markings/sec, 300 secs
lola: sara is running 305 secs || 104427617 markings, 229360396 edges, 317974 markings/sec, 305 secs
lola: sara is running 310 secs || 106032765 markings, 232899202 edges, 321030 markings/sec, 310 secs
lola: sara is running 315 secs || 107654854 markings, 236372177 edges, 324418 markings/sec, 315 secs
lola: sara is running 320 secs || 109232663 markings, 239869102 edges, 315562 markings/sec, 320 secs
lola: sara is running 325 secs || 110778667 markings, 243302946 edges, 309201 markings/sec, 325 secs
lola: sara is running 330 secs || 112320364 markings, 246697544 edges, 308339 markings/sec, 330 secs
lola: sara is running 335 secs || 113964678 markings, 250325366 edges, 328863 markings/sec, 335 secs
lola: sara is running 340 secs || 115560679 markings, 253843384 edges, 319200 markings/sec, 340 secs
lola: sara is running 345 secs || 117145474 markings, 257335935 edges, 316959 markings/sec, 345 secs
lola: sara is running 350 secs || 118698118 markings, 260755414 edges, 310529 markings/sec, 350 secs
lola: sara is running 355 secs || 120263184 markings, 264203124 edges, 313013 markings/sec, 355 secs
lola: sara is running 360 secs || 121879724 markings, 267699365 edges, 323308 markings/sec, 360 secs
lola: sara is running 365 secs || 123460705 markings, 271149428 edges, 316196 markings/sec, 365 secs
lola: sara is running 370 secs || 124995520 markings, 274553475 edges, 306963 markings/sec, 370 secs
lola: sara is running 375 secs || 126537376 markings, 277970997 edges, 308371 markings/sec, 375 secs
lola: sara is running 380 secs || 128063302 markings, 281329754 edges, 305185 markings/sec, 380 secs
lola: sara is running 385 secs || 129756671 markings, 285069065 edges, 338674 markings/sec, 385 secs
lola: sara is running 390 secs || 131406344 markings, 288709065 edges, 329935 markings/sec, 390 secs
lola: sara is running 395 secs || 133049063 markings, 292333259 edges, 328544 markings/sec, 395 secs
lola: sara is running 400 secs || 134710988 markings, 295897279 edges, 332385 markings/sec, 400 secs
lola: sara is running 405 secs || 136261851 markings, 299349468 edges, 310173 markings/sec, 405 secs
lola: sara is running 410 secs || 137906171 markings, 302989741 edges, 328864 markings/sec, 410 secs
lola: sara is running 415 secs || 139520713 markings, 306549901 edges, 322908 markings/sec, 415 secs
lola: sara is running 420 secs || 141127007 markings, 310091313 edges, 321259 markings/sec, 420 secs
lola: sara is running 425 secs || 142700217 markings, 313557532 edges, 314642 markings/sec, 425 secs
lola: sara is running 430 secs || 144287824 markings, 317056472 edges, 317521 markings/sec, 430 secs
lola: sara is running 435 secs || 145959477 markings, 320639744 edges, 334331 markings/sec, 435 secs
lola: sara is running 440 secs || 147536331 markings, 324166300 edges, 315371 markings/sec, 440 secs
lola: sara is running 445 secs || 149128396 markings, 327675374 edges, 318413 markings/sec, 445 secs
lola: sara is running 450 secs || 150713950 markings, 331169650 edges, 317111 markings/sec, 450 secs
lola: sara is running 455 secs || 152268003 markings, 334592332 edges, 310811 markings/sec, 455 secs
lola: sara is running 460 secs || 153850085 markings, 338078714 edges, 316416 markings/sec, 460 secs
lola: sara is running 465 secs || 155407612 markings, 341509294 edges, 311505 markings/sec, 465 secs
lola: sara is running 470 secs || 156969558 markings, 344949913 edges, 312389 markings/sec, 470 secs
lola: sara is running 475 secs || 158508265 markings, 348337718 edges, 307741 markings/sec, 475 secs
lola: sara is running 480 secs || 160026718 markings, 351679492 edges, 303691 markings/sec, 480 secs
lola: sara is running 485 secs || 161689113 markings, 355224452 edges, 332479 markings/sec, 485 secs
lola: sara is running 490 secs || 163272913 markings, 358775453 edges, 316760 markings/sec, 490 secs
lola: sara is running 495 secs || 164874450 markings, 362314663 edges, 320307 markings/sec, 495 secs
lola: sara is running 500 secs || 166454786 markings, 365797082 edges, 316067 markings/sec, 500 secs
lola: sara is running 505 secs || 168024237 markings, 369254759 edges, 313890 markings/sec, 505 secs
lola: sara is running 510 secs || 169631464 markings, 372798290 edges, 321445 markings/sec, 510 secs
lola: sara is running 515 secs || 171203704 markings, 376262307 edges, 314448 markings/sec, 515 secs
lola: sara is running 520 secs || 172743047 markings, 379651557 edges, 307869 markings/sec, 520 secs
lola: sara is running 525 secs || 174294839 markings, 383069099 edges, 310358 markings/sec, 525 secs
lola: sara is running 530 secs || 175803916 markings, 386389563 edges, 301815 markings/sec, 530 secs
lola: sara is running 535 secs || 177437801 markings, 389866470 edges, 326777 markings/sec, 535 secs
lola: sara is running 540 secs || 178985189 markings, 393308081 edges, 309478 markings/sec, 540 secs
lola: sara is running 545 secs || 180527991 markings, 396736087 edges, 308560 markings/sec, 545 secs
lola: sara is running 550 secs || 182070636 markings, 400140454 edges, 308529 markings/sec, 550 secs
lola: sara is running 555 secs || 183591361 markings, 403487390 edges, 304145 markings/sec, 555 secs
lola: sara is running 560 secs || 185120011 markings, 406852339 edges, 305730 markings/sec, 560 secs
lola: sara is running 565 secs || 186655989 markings, 410233938 edges, 307196 markings/sec, 565 secs
lola: sara is running 570 secs || 188157097 markings, 413536292 edges, 300222 markings/sec, 570 secs
lola: sara is running 575 secs || 189686625 markings, 416903236 edges, 305906 markings/sec, 575 secs
lola: sara is running 580 secs || 191180821 markings, 420189880 edges, 298839 markings/sec, 580 secs
lola: sara is running 585 secs || 192760265 markings, 423670269 edges, 315889 markings/sec, 585 secs
lola: sara is running 590 secs || 194383523 markings, 427250235 edges, 324652 markings/sec, 590 secs
lola: sara is running 595 secs || 195972030 markings, 430751220 edges, 317701 markings/sec, 595 secs
lola: sara is running 600 secs || 197565543 markings, 434263585 edges, 318703 markings/sec, 600 secs
lola: sara is running 605 secs || 199184441 markings, 437716648 edges, 323780 markings/sec, 605 secs
lola: sara is running 610 secs || 200742273 markings, 441173533 edges, 311566 markings/sec, 610 secs
lola: sara is running 615 secs || 202296246 markings, 444632781 edges, 310795 markings/sec, 615 secs
lola: sara is running 620 secs || 203874228 markings, 448109847 edges, 315596 markings/sec, 620 secs
lola: sara is running 625 secs || 205439858 markings, 451558842 edges, 313126 markings/sec, 625 secs
lola: sara is running 630 secs || 206979195 markings, 454948078 edges, 307867 markings/sec, 630 secs
lola: sara is running 635 secs || 208489135 markings, 458270504 edges, 301988 markings/sec, 635 secs
lola: sara is running 640 secs || 210050111 markings, 461708921 edges, 312195 markings/sec, 640 secs
lola: sara is running 645 secs || 211381932 markings, 464626527 edges, 266364 markings/sec, 645 secs
lola: sara is running 650 secs || 212661256 markings, 467395659 edges, 255865 markings/sec, 650 secs
lola: sara is running 655 secs || 212924572 markings, 468023272 edges, 52663 markings/sec, 655 secs
lola: sara is running 660 secs || 212925364 markings, 468025071 edges, 158 markings/sec, 660 secs
lola: sara is running 665 secs || 212966671 markings, 468118953 edges, 8261 markings/sec, 665 secs
lola: sara is running 670 secs || 212972202 markings, 468131522 edges, 1106 markings/sec, 670 secs
lola: sara is running 675 secs || 212972271 markings, 468131680 edges, 14 markings/sec, 675 secs
lola: sara is running 680 secs || 212973368 markings, 468134171 edges, 219 markings/sec, 680 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((da + 1 <= mr) OR (a <= a_cap))))
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 (((da + 1 <= mr) OR (a <= a_cap))))
lola: processed formula length: 41
lola: 11 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: ((mr <= da) AND (a_cap + 1 <= a))
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50003 markings, 50002 edges
lola: ========================================
lola: subprocess 13 will run for 958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((a <= 1) OR (a <= 1) OR (((ma <= c_cap) OR (a_cap <= mr)) AND (a <= c_cap)))))
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 (((a <= 1) OR (a <= 1) OR (((ma <= c_cap) OR (a_cap <= mr)) AND (a <= c_cap)))))
lola: processed formula length: 88
lola: 11 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: ((2 <= a) AND (2 <= a) AND (((c_cap + 1 <= ma) AND (mr + 1 <= a_cap)) OR (c_cap + 1 <= a)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 200031 markings, 200064 edges
lola: ========================================
lola: subprocess 14 will run for 1437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((r_cap <= 2) AND ((3 <= ma) OR (da <= c_cap)) AND (c <= mr_cap))))
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 (((r_cap <= 2) AND ((3 <= ma) OR (da <= c_cap)) AND (c <= mr_cap))))
lola: processed formula length: 74
lola: 10 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: ((r_cap <= 2) AND ((3 <= ma) OR (da <= c_cap)) AND (c <= mr_cap))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 100000 markings, 99999 edges
lola: ========================================
lola: subprocess 15 will run for 2875 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((c <= da_a) OR (1 <= c_cap)) AND ((1 <= ma_cap) OR (ma <= r_cap)) AND ((da <= mr_cap) OR (1 <= dr) OR (2 <= r) OR (da_a <= a)))))
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 ((((c <= da_a) OR (1 <= c_cap)) AND ((1 <= ma_cap) OR (ma <= r_cap)) AND ((da <= mr_cap) OR (1 <= dr) OR (2 <= r) OR (da_a <= a)))))
lola: processed formula length: 142
lola: 11 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: (((da_a + 1 <= c) AND (c_cap <= 0)) OR ((ma_cap <= 0) AND (r_cap + 1 <= ma)) OR ((mr_cap + 1 <= da) AND (dr <= 0) AND (r <= 1) AND (a + 1 <= da_a)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 100003 markings, 100003 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((r <= 2) AND (mr <= 1) AND (mr_cap <= a))))
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 (((r <= 2) AND (mr <= 1) AND (mr_cap <= a))))
lola: processed formula length: 50
lola: 10 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: ((r <= 2) AND (mr <= 1) AND (mr_cap <= a))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
lola: sara is running 0 secs || 2261674 markings, 4594530 edges, 452335 markings/sec, 0 secs
lola: sara is running 5 secs || 4155724 markings, 8666287 edges, 378810 markings/sec, 5 secs
lola: sara is running 10 secs || 5950288 markings, 12704600 edges, 358913 markings/sec, 10 secs
lola: sara is running 15 secs || 7700894 markings, 16573994 edges, 350121 markings/sec, 15 secs
lola: sara is running 20 secs || 9497447 markings, 20490054 edges, 359311 markings/sec, 20 secs
lola: sara is running 25 secs || 11231872 markings, 24325804 edges, 346885 markings/sec, 25 secs
lola: sara is running 30 secs || 12961403 markings, 28147298 edges, 345906 markings/sec, 30 secs
lola: sara is running 35 secs || 14696440 markings, 31885633 edges, 347007 markings/sec, 35 secs
lola: sara is running 40 secs || 16355850 markings, 35588808 edges, 331882 markings/sec, 40 secs
lola: sara is running 45 secs || 18099207 markings, 39441727 edges, 348671 markings/sec, 45 secs
lola: sara is running 50 secs || 19783890 markings, 43161296 edges, 336937 markings/sec, 50 secs
lola: sara is running 55 secs || 21492257 markings, 46871285 edges, 341673 markings/sec, 55 secs
lola: sara is running 60 secs || 23155449 markings, 50550787 edges, 332638 markings/sec, 60 secs
lola: sara is running 65 secs || 24839742 markings, 54269467 edges, 336859 markings/sec, 65 secs
lola: sara is running 70 secs || 26506388 markings, 57948045 edges, 333329 markings/sec, 70 secs
lola: sara is running 75 secs || 28176451 markings, 61522068 edges, 334013 markings/sec, 75 secs
lola: sara is running 80 secs || 29792103 markings, 65142437 edges, 323130 markings/sec, 80 secs
lola: sara is running 85 secs || 31416523 markings, 68725043 edges, 324884 markings/sec, 85 secs
lola: sara is running 90 secs || 33093108 markings, 72426206 edges, 335317 markings/sec, 90 secs
lola: sara is running 95 secs || 34757667 markings, 76100038 edges, 332912 markings/sec, 95 secs
lola: sara is running 100 secs || 36454740 markings, 79754734 edges, 339415 markings/sec, 100 secs
lola: sara is running 105 secs || 38082219 markings, 83382698 edges, 325496 markings/sec, 105 secs
lola: sara is running 110 secs || 39702339 markings, 86955533 edges, 324024 markings/sec, 110 secs
lola: sara is running 115 secs || 41337476 markings, 90562494 edges, 327027 markings/sec, 115 secs
lola: sara is running 120 secs || 42890134 markings, 93982006 edges, 310532 markings/sec, 120 secs
lola: sara is running 125 secs || 44483285 markings, 97493547 edges, 318630 markings/sec, 125 secs
lola: sara is running 130 secs || 46061758 markings, 100969077 edges, 315695 markings/sec, 130 secs
lola: sara is running 135 secs || 47673581 markings, 104408256 edges, 322365 markings/sec, 135 secs
lola: sara is running 140 secs || 49283029 markings, 108019659 edges, 321890 markings/sec, 140 secs
lola: sara is running 145 secs || 50918564 markings, 111627528 edges, 327107 markings/sec, 145 secs
lola: sara is running 150 secs || 52503284 markings, 115119903 edges, 316944 markings/sec, 150 secs
lola: sara is running 155 secs || 54090213 markings, 118617305 edges, 317386 markings/sec, 155 secs
lola: sara is running 160 secs || 55635009 markings, 122018951 edges, 308959 markings/sec, 160 secs
lola: sara is running 165 secs || 57220779 markings, 125513716 edges, 317154 markings/sec, 165 secs
lola: sara is running 170 secs || 58783135 markings, 128955267 edges, 312471 markings/sec, 170 secs
lola: sara is running 175 secs || 60369479 markings, 132379116 edges, 317269 markings/sec, 175 secs
lola: sara is running 180 secs || 61936677 markings, 135793745 edges, 313440 markings/sec, 180 secs
lola: sara is running 185 secs || 63466702 markings, 139183420 edges, 306005 markings/sec, 185 secs
lola: sara is running 190 secs || 65027135 markings, 142654521 edges, 312087 markings/sec, 190 secs
lola: sara is running 195 secs || 66678966 markings, 146299427 edges, 330366 markings/sec, 195 secs
lola: sara is running 200 secs || 68281779 markings, 149832924 edges, 320563 markings/sec, 200 secs
lola: sara is running 205 secs || 69892769 markings, 153385010 edges, 322198 markings/sec, 205 secs
lola: sara is running 210 secs || 71466124 markings, 156851560 edges, 314671 markings/sec, 210 secs
lola: sara is running 215 secs || 73079980 markings, 160391691 edges, 322771 markings/sec, 215 secs
lola: sara is running 220 secs || 74694903 markings, 163865023 edges, 322985 markings/sec, 220 secs
lola: sara is running 225 secs || 76225167 markings, 167255416 edges, 306053 markings/sec, 225 secs
lola: sara is running 230 secs || 77775713 markings, 170699878 edges, 310109 markings/sec, 230 secs
lola: sara is running 235 secs || 79305340 markings, 174067047 edges, 305925 markings/sec, 235 secs
lola: sara is running 240 secs || 80877516 markings, 177530921 edges, 314435 markings/sec, 240 secs
lola: sara is running 245 secs || 82464244 markings, 181027862 edges, 317346 markings/sec, 245 secs
lola: sara is running 250 secs || 84036031 markings, 184490848 edges, 314357 markings/sec, 250 secs
lola: sara is running 255 secs || 85592616 markings, 187919284 edges, 311317 markings/sec, 255 secs
lola: sara is running 260 secs || 87130025 markings, 191304141 edges, 307482 markings/sec, 260 secs
lola: sara is running 265 secs || 88637761 markings, 194621556 edges, 301547 markings/sec, 265 secs
lola: sara is running 270 secs || 90188399 markings, 198036477 edges, 310128 markings/sec, 270 secs
lola: sara is running 275 secs || 91692481 markings, 201345587 edges, 300816 markings/sec, 275 secs
lola: sara is running 280 secs || 93210288 markings, 204685891 edges, 303561 markings/sec, 280 secs
lola: sara is running 285 secs || 94705412 markings, 207974646 edges, 299025 markings/sec, 285 secs
lola: sara is running 290 secs || 96223768 markings, 211316197 edges, 303671 markings/sec, 290 secs
lola: sara is running 295 secs || 97840071 markings, 214855808 edges, 323261 markings/sec, 295 secs
lola: sara is running 300 secs || 99447351 markings, 218315768 edges, 321456 markings/sec, 300 secs
lola: sara is running 305 secs || 100981603 markings, 221718123 edges, 306850 markings/sec, 305 secs
lola: sara is running 310 secs || 102515635 markings, 225119819 edges, 306806 markings/sec, 310 secs
lola: sara is running 315 secs || 104019525 markings, 228431089 edges, 300778 markings/sec, 315 secs
lola: sara is running 320 secs || 105582677 markings, 231876276 edges, 312630 markings/sec, 320 secs
lola: sara is running 325 secs || 107098560 markings, 235212209 edges, 303177 markings/sec, 325 secs
lola: sara is running 330 secs || 108623431 markings, 238568567 edges, 304974 markings/sec, 330 secs
lola: sara is running 335 secs || 110116192 markings, 241851949 edges, 298552 markings/sec, 335 secs
lola: sara is running 340 secs || 111601403 markings, 245118171 edges, 297042 markings/sec, 340 secs
lola: sara is running 345 secs || 113117895 markings, 248455487 edges, 303298 markings/sec, 345 secs
lola: sara is running 350 secs || 114665478 markings, 251863466 edges, 309517 markings/sec, 350 secs
lola: sara is running 355 secs || 116171295 markings, 255176519 edges, 301163 markings/sec, 355 secs
lola: sara is running 360 secs || 117682464 markings, 258501740 edges, 302234 markings/sec, 360 secs
lola: sara is running 365 secs || 119156841 markings, 261743338 edges, 294875 markings/sec, 365 secs
lola: sara is running 370 secs || 120666978 markings, 265066211 edges, 302027 markings/sec, 370 secs
lola: sara is running 375 secs || 122179075 markings, 268393539 edges, 302419 markings/sec, 375 secs
lola: sara is running 380 secs || 123667677 markings, 271667466 edges, 297720 markings/sec, 380 secs
lola: sara is running 385 secs || 125142654 markings, 274910430 edges, 294995 markings/sec, 385 secs
lola: sara is running 390 secs || 126621025 markings, 278161109 edges, 295674 markings/sec, 390 secs
lola: sara is running 395 secs || 128055900 markings, 281312933 edges, 286975 markings/sec, 395 secs
lola: sara is running 400 secs || 129691175 markings, 284920208 edges, 327055 markings/sec, 400 secs
lola: sara is running 405 secs || 131271108 markings, 288401710 edges, 315987 markings/sec, 405 secs
lola: sara is running 410 secs || 132850837 markings, 291882746 edges, 315946 markings/sec, 410 secs
lola: sara is running 415 secs || 134405165 markings, 295306052 edges, 310866 markings/sec, 415 secs
lola: sara is running 420 secs || 135918517 markings, 298636233 edges, 302670 markings/sec, 420 secs
lola: sara is running 425 secs || 137471593 markings, 302056695 edges, 310615 markings/sec, 425 secs
lola: sara is running 430 secs || 139022625 markings, 305472511 edges, 310206 markings/sec, 430 secs
lola: sara is running 435 secs || 140548205 markings, 308830480 edges, 305116 markings/sec, 435 secs
lola: sara is running 440 secs || 142065953 markings, 312170651 edges, 303550 markings/sec, 440 secs
lola: sara is running 445 secs || 143556082 markings, 315448049 edges, 298026 markings/sec, 445 secs
lola: sara is running 450 secs || 145156587 markings, 318880009 edges, 320101 markings/sec, 450 secs
lola: sara is running 455 secs || 146705236 markings, 322276823 edges, 309730 markings/sec, 455 secs
lola: sara is running 460 secs || 148208976 markings, 325587641 edges, 300748 markings/sec, 460 secs
lola: sara is running 465 secs || 149729331 markings, 328948307 edges, 304071 markings/sec, 465 secs
lola: sara is running 470 secs || 151224744 markings, 332234146 edges, 299083 markings/sec, 470 secs
lola: sara is running 475 secs || 152718225 markings, 335514189 edges, 298696 markings/sec, 475 secs
lola: sara is running 480 secs || 154214344 markings, 338802146 edges, 299224 markings/sec, 480 secs
lola: sara is running 485 secs || 155705153 markings, 342074174 edges, 298162 markings/sec, 485 secs
lola: sara is running 490 secs || 157195646 markings, 345345252 edges, 298099 markings/sec, 490 secs
lola: sara is running 495 secs || 158634373 markings, 348559992 edges, 287745 markings/sec, 495 secs
lola: sara is running 500 secs || 160052075 markings, 351737121 edges, 283540 markings/sec, 500 secs
lola: sara is running 505 secs || 161607699 markings, 355133806 edges, 311125 markings/sec, 505 secs
lola: sara is running 510 secs || 163187252 markings, 358518471 edges, 315911 markings/sec, 510 secs
lola: sara is running 515 secs || 164703305 markings, 361866230 edges, 303211 markings/sec, 515 secs
lola: sara is running 520 secs || 166210057 markings, 365186085 edges, 301350 markings/sec, 520 secs
lola: sara is running 525 secs || 167702682 markings, 368463561 edges, 298525 markings/sec, 525 secs
lola: sara is running 530 secs || 169225845 markings, 371832650 edges, 304633 markings/sec, 530 secs
lola: sara is running 535 secs || 170727951 markings, 375138566 edges, 300421 markings/sec, 535 secs
lola: sara is running 540 secs || 172200770 markings, 378356625 edges, 294564 markings/sec, 540 secs
lola: sara is running 545 secs || 173693268 markings, 381633719 edges, 298500 markings/sec, 545 secs
lola: sara is running 550 secs || 175106635 markings, 384834938 edges, 282673 markings/sec, 550 secs
lola: sara is running 555 secs || 176546800 markings, 388023307 edges, 288033 markings/sec, 555 secs
lola: sara is running 560 secs || 178046765 markings, 391323063 edges, 299993 markings/sec, 560 secs
lola: sara is running 565 secs || 179520960 markings, 394564249 edges, 294839 markings/sec, 565 secs
lola: sara is running 570 secs || 180999186 markings, 397814596 edges, 295645 markings/sec, 570 secs
lola: sara is running 575 secs || 182448738 markings, 400999776 edges, 289910 markings/sec, 575 secs
lola: sara is running 580 secs || 183865794 markings, 404111102 edges, 283411 markings/sec, 580 secs
lola: sara is running 585 secs || 185316768 markings, 407299514 edges, 290195 markings/sec, 585 secs
lola: sara is running 590 secs || 186761498 markings, 410473733 edges, 288946 markings/sec, 590 secs
lola: sara is running 595 secs || 188165343 markings, 413555032 edges, 280769 markings/sec, 595 secs
lola: sara is running 600 secs || 189602869 markings, 416712882 edges, 287505 markings/sec, 600 secs
lola: sara is running 605 secs || 191017292 markings, 419801191 edges, 282885 markings/sec, 605 secs
lola: sara is running 610 secs || 192499504 markings, 423047427 edges, 296442 markings/sec, 610 secs
lola: sara is running 615 secs || 194032152 markings, 426444970 edges, 306530 markings/sec, 615 secs
lola: sara is running 620 secs || 195557843 markings, 429809886 edges, 305138 markings/sec, 620 secs
lola: sara is running 625 secs || 197048796 markings, 433089160 edges, 298191 markings/sec, 625 secs
lola: sara is running 630 secs || 198555255 markings, 436403671 edges, 301292 markings/sec, 630 secs
lola: sara is running 635 secs || 200019620 markings, 439605774 edges, 292873 markings/sec, 635 secs
lola: sara is running 640 secs || 201468128 markings, 442750898 edges, 289702 markings/sec, 640 secs
lola: sara is running 645 secs || 202985994 markings, 446104097 edges, 303573 markings/sec, 645 secs
lola: sara is running 650 secs || 204496128 markings, 449434097 edges, 302027 markings/sec, 650 secs
lola: sara is running 655 secs || 206012974 markings, 452784237 edges, 303369 markings/sec, 655 secs
lola: sara is running 660 secs || 207512564 markings, 456082607 edges, 299918 markings/sec, 660 secs
lola: sara is running 665 secs || 209022596 markings, 459412302 edges, 302006 markings/sec, 665 secs
lola: sara is running 670 secs || 210563869 markings, 462821922 edges, 308255 markings/sec, 670 secs
lola: sara is running 675 secs || 212073881 markings, 466144512 edges, 302002 markings/sec, 675 secs
lola: sara is running 680 secs || 212798655 markings, 467737097 edges, 144955 markings/sec, 680 secs
lola: sara is running 685 secs || 212960768 markings, 468105537 edges, 32423 markings/sec, 685 secs
lola: sara is running 690 secs || 212963711 markings, 468112222 edges, 589 markings/sec, 690 secs
lola: sara is running 695 secs || 212964861 markings, 468114839 edges, 230 markings/sec, 695 secs
lola: sara is running 700 secs || 212964893 markings, 468114912 edges, 6 markings/sec, 700 secs
lola: sara is running 705 secs || 212977383 markings, 468143297 edges, 2498 markings/sec, 705 secs
lola: sara is running 710 secs || 212985349 markings, 468161403 edges, 1593 markings/sec, 710 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown yes no no yes yes no no no no no no no no
lola:
preliminary result: no no unknown yes no no yes yes no no no no no no no no
lola: memory consumption: 21600 KB
lola: time consumption: 1415 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552537406317

--------------------
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="CircadianClock-PT-100000"
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-3957"
echo " Executing tool lola"
echo " Input is CircadianClock-PT-100000, 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 r027-smll-155225120900161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-100000.tgz
mv CircadianClock-PT-100000 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 ;