Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r075-tajo-158922839600089.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is Diffusion2D-PT-D05N010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839600089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.4K Mar 31 06:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 06:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 29 22:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 22:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 55K Mar 24 05:37 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 Diffusion2D-PT-D05N010-00
FORMULA_NAME Diffusion2D-PT-D05N010-01
FORMULA_NAME Diffusion2D-PT-D05N010-02
FORMULA_NAME Diffusion2D-PT-D05N010-03
FORMULA_NAME Diffusion2D-PT-D05N010-04
FORMULA_NAME Diffusion2D-PT-D05N010-05
FORMULA_NAME Diffusion2D-PT-D05N010-06
FORMULA_NAME Diffusion2D-PT-D05N010-07
FORMULA_NAME Diffusion2D-PT-D05N010-08
FORMULA_NAME Diffusion2D-PT-D05N010-09
FORMULA_NAME Diffusion2D-PT-D05N010-10
FORMULA_NAME Diffusion2D-PT-D05N010-11
FORMULA_NAME Diffusion2D-PT-D05N010-12
FORMULA_NAME Diffusion2D-PT-D05N010-13
FORMULA_NAME Diffusion2D-PT-D05N010-14
FORMULA_NAME Diffusion2D-PT-D05N010-15

=== Now, execution of the tool begins

BK_START 1589543709593

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D05N010 @ 3570 seconds

FORMULA Diffusion2D-PT-D05N010-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D05N010-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2698
rslt: Output for LTLCardinality @ Diffusion2D-PT-D05N010

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 11:55:09 2020
",
"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": 121
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F ((X (F (((cAMP__1_4_ <= 2) R (cAMP__1_5_ + 1 <= cAMP__1_4_)))) OR F ((cAMP__5_2_ <= 1)))))",
"processed_size": 95,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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 (X (F ((cAMP__2_1_ <= cAMP__3_3_))))",
"processed_size": 38,
"rewrites": 121
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F (((cAMP__5_5_ + 1 <= cAMP__1_5_) OR X ((2 <= cAMP__3_2_))))))",
"processed_size": 69,
"rewrites": 121
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[

{
"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": 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": "(cAMP__5_2_ <= cAMP__1_2_)",
"processed_size": 26,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F ((F ((2 <= cAMP__5_3_)) AND F ((1 <= cAMP__2_2_)))))",
"processed_size": 57,
"rewrites": 121
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (F ((X (X (G ((cAMP__2_3_ <= 1)))) OR F ((cAMP__2_3_ <= 1)))))",
"processed_size": 64,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((X (X (G (((cAMP__2_5_ <= cAMP__4_1_) AND (((cAMP__5_5_ <= cAMP__2_2_)) U (cAMP__5_5_ <= cAMP__2_2_)))))) OR ((cAMP__2_2_ + 1 <= cAMP__5_5_) U (cAMP__2_5_ <= cAMP__5_4_))))",
"processed_size": 175,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0))))))",
"processed_size": 60,
"rewrites": 121
},
"result":
{
"edges": 27,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F (((cAMP__2_5_ <= 1) AND X ((cAMP__3_2_ <= 0))))))",
"processed_size": 57,
"rewrites": 121
},
"result":
{
"edges": 113,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((cAMP__1_1_ <= cAMP__2_2_) AND G (((cAMP__1_1_ <= cAMP__2_2_) OR ((cAMP__5_3_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__1_1_))))) U X (G ((cAMP__1_1_ <= cAMP__2_2_)))))",
"processed_size": 167,
"rewrites": 121
},
"result":
{
"edges": 181881,
"markings": 49412,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 810
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((3 <= cAMP__4_1_))))",
"processed_size": 29,
"rewrites": 121
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1080
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((cAMP__1_1_ + 1 <= cAMP__3_2_) OR (1 <= cAMP__3_4_)) OR G ((3 <= cAMP__4_1_)))))",
"processed_size": 89,
"rewrites": 121
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1621
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1621
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(1 <= cAMP__3_4_)",
"processed_size": 17,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3242
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3242
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (F ((cAMP__3_1_ + 1 <= cAMP__4_3_))))",
"processed_size": 42,
"rewrites": 121
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22584,
"runtime": 872.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(G(F((* OR X(*))))) : A(F((X(F((* R *))) OR F(**)))) : (A(F(G(*))) AND A(G(F(*)))) : (** AND A(F(G(**)))) : A(G((** OR G(**)))) : A(X(F(**))) : TRUE : (** AND (A(X(**)) AND A(F((F(**) AND F(**)))))) : A(G((** OR X(TRUE)))) : A(F((X(X(G(*))) OR F(**)))) : A((X(X(G((** AND (** U **))))) OR (** U **))) : (A(G(F((F(**) OR G(**))))) AND A(G((X(F(**)) OR (F(**) OR G(**)))))) : (A(G(F((F(**) OR X(**))))) AND A(G(F((* AND X(*)))))) : A(((** AND G(**)) U X(G(**)))) : A(X(G(**)))"
},
"net":
{
"arcs": 288,
"conflict_clusters": 25,
"places": 25,
"places_significant": 24,
"singleton_clusters": 0,
"transitions": 144
},
"result":
{
"preliminary_value": "yes no yes no no no yes yes no unknown yes yes no no no no ",
"value": "yes no yes no no no yes yes no unknown yes yes 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: 169/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 144 transitions, 24 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 LTLCardinality.xml
lola: A (((F ((cAMP__5_5_ <= cAMP__3_5_)) AND NOT(G (F (X ((3 <= cAMP__4_2_)))))) OR F ((0 <= cAMP__3_2_)))) : A (NOT(F (X (G (((cAMP__1_5_ <= cAMP__5_5_) AND X ((cAMP__3_2_ <= 1)))))))) : A (F ((F (NOT(X (((3 <= cAMP__1_4_) U (cAMP__1_4_ <= cAMP__1_5_))))) OR F ((cAMP__5_2_ <= 1))))) : A (NOT(F ((((cAMP__4_3_ <= cAMP__3_1_) U F (G (F ((cAMP__4_4_ <= cAMP__2_2_))))) OR X (F (G ((cAMP__4_3_ <= cAMP__3_1_)))))))) : A (((1 <= cAMP__3_4_) AND ((0 <= cAMP__5_2_) U X (G ((cAMP__2_2_ <= cAMP__4_1_)))))) : A (G ((((cAMP__1_1_ + 1 <= cAMP__3_2_) OR (1 <= cAMP__3_4_)) OR G ((3 <= cAMP__4_1_))))) : A (X (F ((cAMP__2_1_ <= cAMP__3_3_)))) : A (((F ((0 <= cAMP__4_3_)) OR G (())) OR ((cAMP__2_5_ <= cAMP__3_2_) AND X ((cAMP__2_5_ <= cAMP__3_2_))))) : A ((((cAMP__5_2_ <= cAMP__1_2_) AND X ((cAMP__1_3_ <= cAMP__3_3_))) AND NOT(G (NOT((F ((2 <= cAMP__5_3_)) AND F (((2 <= cAMP__5_3_) U (1 <= cAMP__2_2_))))))))) : A (G ((((cAMP__2_4_ <= cAMP__5_4_) OR X ((0 <= cAMP__5_2_))) OR ((0 <= cAMP__5_2_) AND X ((cAMP__5_4_ + 1 <= cAMP__2_4_)))))) : A (NOT(G ((F (X (X ((2 <= cAMP__2_3_)))) AND NOT(F ((cAMP__2_3_ <= 1))))))) : A ((G (X (X (((cAMP__2_5_ <= cAMP__4_1_) AND (((cAMP__5_5_ <= cAMP__2_2_)) U (cAMP__5_5_ <= cAMP__2_2_)))))) OR ((cAMP__2_2_ + 1 <= cAMP__5_5_) U (cAMP__2_5_ <= cAMP__5_4_)))) : A (G ((F (X ((cAMP__3_1_ + 1 <= cAMP__4_4_))) U (F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0)))))) : A (NOT(F ((G (NOT((F ((2 <= cAMP__5_3_)) OR X ((2 <= cAMP__2_5_))))) OR G (((2 <= cAMP__2_5_) OR X ((1 <= cAMP__3_2_)))))))) : A ((((cAMP__1_1_ <= cAMP__2_2_) AND G (((cAMP__1_1_ <= cAMP__2_2_) OR ((cAMP__5_3_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__1_1_))))) U G (X ((cAMP__1_1_ <= cAMP__2_2_))))) : A (NOT((NOT(((cAMP__5_1_ + 1 <= cAMP__2_4_) U (0 <= cAMP__5_2_))) OR NOT(G (X ((3 <= cAMP__4_1_)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: 121 rewrites
lola: closed formula file LTLCardinality.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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 121 rewrites
lola: closed formula file LTLCardinality.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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (F (((cAMP__1_4_ <= 2) R (cAMP__1_5_ + 1 <= cAMP__1_4_)))) OR F ((cAMP__5_2_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (F (((cAMP__1_4_ <= 2) R (cAMP__1_5_ + 1 <= cAMP__1_4_)))) OR F ((cAMP__5_2_ <= 1)))))
lola: processed formula length: 95
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((cAMP__2_1_ <= cAMP__3_3_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((cAMP__2_1_ <= cAMP__3_3_))))
lola: processed formula length: 38
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((cAMP__5_5_ + 1 <= cAMP__1_5_) OR X ((2 <= cAMP__3_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((cAMP__5_5_ + 1 <= cAMP__1_5_) OR X ((2 <= cAMP__3_2_))))))
lola: processed formula length: 69
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cAMP__5_2_ <= cAMP__1_2_) AND (A (X ((cAMP__1_3_ <= cAMP__3_3_))) AND A (F ((F ((2 <= cAMP__5_3_)) AND F ((1 <= cAMP__2_2_)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (cAMP__5_2_ <= cAMP__1_2_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cAMP__5_2_ <= cAMP__1_2_)
lola: processed formula length: 26
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= cAMP__5_3_)) AND F ((1 <= cAMP__2_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((2 <= cAMP__5_3_)) AND F ((1 <= cAMP__2_2_)))))
lola: processed formula length: 57
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__2_4_ <= cAMP__5_4_) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((cAMP__2_4_ <= cAMP__5_4_) OR X (TRUE))))
lola: processed formula length: 48
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1709367 markings, 6106940 edges, 341873 markings/sec, 0 secs
lola: 3215450 markings, 11763246 edges, 301217 markings/sec, 5 secs
lola: 4471995 markings, 16646578 edges, 251309 markings/sec, 10 secs
lola: 5706076 markings, 21575923 edges, 246816 markings/sec, 15 secs
lola: 6908518 markings, 26294776 edges, 240488 markings/sec, 20 secs
lola: 7993427 markings, 30645718 edges, 216982 markings/sec, 25 secs
lola: 9125105 markings, 35295596 edges, 226336 markings/sec, 30 secs
lola: 10276772 markings, 39905605 edges, 230333 markings/sec, 35 secs
lola: 11371424 markings, 44382930 edges, 218930 markings/sec, 40 secs
lola: 12438952 markings, 48813412 edges, 213506 markings/sec, 45 secs
lola: 13471934 markings, 53103770 edges, 206596 markings/sec, 50 secs
lola: 14518153 markings, 57387947 edges, 209244 markings/sec, 55 secs
lola: 15559027 markings, 61709056 edges, 208175 markings/sec, 60 secs
lola: 16578636 markings, 65968146 edges, 203922 markings/sec, 65 secs
lola: 17595747 markings, 70272694 edges, 203422 markings/sec, 70 secs
lola: 18603995 markings, 74508849 edges, 201650 markings/sec, 75 secs
lola: 19524593 markings, 78383406 edges, 184120 markings/sec, 80 secs
lola: 20410771 markings, 82154691 edges, 177236 markings/sec, 85 secs
lola: 21314266 markings, 85902540 edges, 180699 markings/sec, 90 secs
lola: 22252144 markings, 89880527 edges, 187576 markings/sec, 95 secs
lola: 23169841 markings, 93730656 edges, 183539 markings/sec, 100 secs
lola: 24112473 markings, 97768419 edges, 188526 markings/sec, 105 secs
lola: 25077099 markings, 101880715 edges, 192925 markings/sec, 110 secs
lola: 25965772 markings, 105660440 edges, 177735 markings/sec, 115 secs
lola: 26828184 markings, 109399422 edges, 172482 markings/sec, 120 secs
lola: 27723297 markings, 113241980 edges, 179023 markings/sec, 125 secs
lola: 28575395 markings, 116872072 edges, 170420 markings/sec, 130 secs
lola: 29387022 markings, 120454596 edges, 162325 markings/sec, 135 secs
lola: 30255283 markings, 124144526 edges, 173652 markings/sec, 140 secs
lola: 31137773 markings, 127933149 edges, 176498 markings/sec, 145 secs
lola: 31975524 markings, 131522415 edges, 167550 markings/sec, 150 secs
lola: 32821597 markings, 135165216 edges, 169215 markings/sec, 155 secs
lola: 33660394 markings, 138882689 edges, 167759 markings/sec, 160 secs
lola: 34457188 markings, 142380974 edges, 159359 markings/sec, 165 secs
lola: 35266993 markings, 145874339 edges, 161961 markings/sec, 170 secs
lola: 36090398 markings, 149429875 edges, 164681 markings/sec, 175 secs
lola: 36911343 markings, 152946736 edges, 164189 markings/sec, 180 secs
lola: 37712832 markings, 156388907 edges, 160298 markings/sec, 185 secs
lola: 38515151 markings, 159865174 edges, 160464 markings/sec, 190 secs
lola: 39359089 markings, 163539137 edges, 168788 markings/sec, 195 secs
lola: 40150110 markings, 166999341 edges, 158204 markings/sec, 200 secs
lola: 40944207 markings, 170467618 edges, 158819 markings/sec, 205 secs
lola: 41795565 markings, 174135258 edges, 170272 markings/sec, 210 secs
lola: 42625081 markings, 177774627 edges, 165903 markings/sec, 215 secs
lola: 43396740 markings, 181156357 edges, 154332 markings/sec, 220 secs
lola: 44166392 markings, 184593741 edges, 153930 markings/sec, 225 secs
lola: 44966087 markings, 188125472 edges, 159939 markings/sec, 230 secs
lola: 45744358 markings, 191614508 edges, 155654 markings/sec, 235 secs
lola: 46526479 markings, 195035407 edges, 156424 markings/sec, 240 secs
lola: 47317783 markings, 198588303 edges, 158261 markings/sec, 245 secs
lola: 48122704 markings, 202124717 edges, 160984 markings/sec, 250 secs
lola: 48905070 markings, 205563515 edges, 156473 markings/sec, 255 secs
lola: 49648653 markings, 208859975 edges, 148717 markings/sec, 260 secs
lola: 50403277 markings, 212241676 edges, 150925 markings/sec, 265 secs
lola: 51142284 markings, 215562590 edges, 147801 markings/sec, 270 secs
lola: 51748235 markings, 218265245 edges, 121190 markings/sec, 275 secs
lola: 51778342 markings, 218391638 edges, 6021 markings/sec, 280 secs
lola: 51779371 markings, 218396078 edges, 206 markings/sec, 285 secs
lola: 51780354 markings, 218400453 edges, 197 markings/sec, 290 secs
lola: 51785307 markings, 218424901 edges, 991 markings/sec, 295 secs
lola: 51786789 markings, 218430624 edges, 296 markings/sec, 300 secs
lola: 51792066 markings, 218456918 edges, 1055 markings/sec, 305 secs
lola: 51828640 markings, 218621036 edges, 7315 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (X (G ((cAMP__2_3_ <= 1)))) OR F ((cAMP__2_3_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (X (G ((cAMP__2_3_ <= 1)))) OR F ((cAMP__2_3_ <= 1)))))
lola: processed formula length: 64
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G (((cAMP__2_5_ <= cAMP__4_1_) AND (((cAMP__5_5_ <= cAMP__2_2_)) U (cAMP__5_5_ <= cAMP__2_2_)))))) OR ((cAMP__2_2_ + 1 <= cAMP__5_5_) U (cAMP__2_5_ <= cAMP__5_4_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (((cAMP__2_5_ <= cAMP__4_1_) AND (((cAMP__5_5_ <= cAMP__2_2_)) U (cAMP__5_5_ <= cAMP__2_2_)))))) OR ((cAMP__2_2_ + 1 <= cAMP__5_5_) U (cAMP__2_5_ <= cAMP__5_4_))))
lola: processed formula length: 175
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0)))))) AND A (G ((X (F ((cAMP__3_1_ + 1 <= cAMP__4_4_))) OR (F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F ((2 <= cAMP__5_2_)) OR G ((cAMP__3_2_ <= 0))))))
lola: processed formula length: 60
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 21
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((F ((2 <= cAMP__5_3_)) OR X ((2 <= cAMP__2_5_)))))) AND A (G (F (((cAMP__2_5_ <= 1) AND X ((cAMP__3_2_ <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((cAMP__2_5_ <= 1) AND X ((cAMP__3_2_ <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((cAMP__2_5_ <= 1) AND X ((cAMP__3_2_ <= 0))))))
lola: processed formula length: 57
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 59 markings, 113 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((cAMP__1_1_ <= cAMP__2_2_) AND G (((cAMP__1_1_ <= cAMP__2_2_) OR ((cAMP__5_3_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__1_1_))))) U X (G ((cAMP__1_1_ <= cAMP__2_2_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((cAMP__1_1_ <= cAMP__2_2_) AND G (((cAMP__1_1_ <= cAMP__2_2_) OR ((cAMP__5_3_ <= 2) AND (cAMP__2_2_ + 1 <= cAMP__1_1_))))) U X (G ((cAMP__1_1_ <= cAMP__2_2_)))))
lola: processed formula length: 167
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 49412 markings, 181881 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((3 <= cAMP__4_1_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= cAMP__4_1_))))
lola: processed formula length: 29
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((cAMP__1_1_ + 1 <= cAMP__3_2_) OR (1 <= cAMP__3_4_)) OR G ((3 <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((((cAMP__1_1_ + 1 <= cAMP__3_2_) OR (1 <= cAMP__3_4_)) OR G ((3 <= cAMP__4_1_)))))
lola: processed formula length: 89
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= cAMP__3_4_) AND A (F (G ((cAMP__2_2_ <= cAMP__4_1_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= cAMP__3_4_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= cAMP__3_4_)
lola: processed formula length: 17
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((cAMP__2_2_ + 1 <= cAMP__4_4_)))) AND A (G (F ((cAMP__3_1_ + 1 <= cAMP__4_3_)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((cAMP__3_1_ + 1 <= cAMP__4_3_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((cAMP__3_1_ + 1 <= cAMP__4_3_))))
lola: processed formula length: 42
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__2_4_ <= cAMP__5_4_) OR X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((cAMP__2_4_ <= cAMP__5_4_) OR X (TRUE))))
lola: processed formula length: 48
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1439478 markings, 5126521 edges, 287896 markings/sec, 0 secs
lola: 2632722 markings, 9515478 edges, 238649 markings/sec, 5 secs
lola: 3566005 markings, 13116998 edges, 186657 markings/sec, 10 secs
lola: 4415836 markings, 16419500 edges, 169966 markings/sec, 15 secs
lola: 5216185 markings, 19601987 edges, 160070 markings/sec, 20 secs
lola: 5971577 markings, 22619968 edges, 151078 markings/sec, 25 secs
lola: 6698710 markings, 25455005 edges, 145427 markings/sec, 30 secs
lola: 7406445 markings, 28291631 edges, 141547 markings/sec, 35 secs
lola: 8090526 markings, 31046095 edges, 136816 markings/sec, 40 secs
lola: 8771486 markings, 33860878 edges, 136192 markings/sec, 45 secs
lola: 9445775 markings, 36573392 edges, 134858 markings/sec, 50 secs
lola: 10129454 markings, 39292046 edges, 136736 markings/sec, 55 secs
lola: 10782964 markings, 41992770 edges, 130702 markings/sec, 60 secs
lola: 11425903 markings, 44620098 edges, 128588 markings/sec, 65 secs
lola: 12069094 markings, 47246916 edges, 128638 markings/sec, 70 secs
lola: 12696351 markings, 49881954 edges, 125451 markings/sec, 75 secs
lola: 13306082 markings, 52422697 edges, 121946 markings/sec, 80 secs
lola: 13925617 markings, 54971285 edges, 123907 markings/sec, 85 secs
lola: 14544217 markings, 57495644 edges, 123720 markings/sec, 90 secs
lola: 15167905 markings, 60076601 edges, 124738 markings/sec, 95 secs
lola: 15767577 markings, 62561279 edges, 119934 markings/sec, 100 secs
lola: 16350060 markings, 64992410 edges, 116497 markings/sec, 105 secs
lola: 16927410 markings, 67429588 edges, 115470 markings/sec, 110 secs
lola: 17521225 markings, 69946488 edges, 118763 markings/sec, 115 secs
lola: 18107973 markings, 72415209 edges, 117350 markings/sec, 120 secs
lola: 18696307 markings, 74875299 edges, 117667 markings/sec, 125 secs
lola: 19253201 markings, 77257360 edges, 111379 markings/sec, 130 secs
lola: 19803735 markings, 79601568 edges, 110107 markings/sec, 135 secs
lola: 20361905 markings, 81952254 edges, 111634 markings/sec, 140 secs
lola: 20941150 markings, 84353425 edges, 115849 markings/sec, 145 secs
lola: 21501578 markings, 86717096 edges, 112086 markings/sec, 150 secs
lola: 22063290 markings, 89075090 edges, 112342 markings/sec, 155 secs
lola: 22633434 markings, 91447570 edges, 114029 markings/sec, 160 secs
lola: 23190540 markings, 93808233 edges, 111421 markings/sec, 165 secs
lola: 23751056 markings, 96210621 edges, 112103 markings/sec, 170 secs
lola: 24298383 markings, 98577825 edges, 109465 markings/sec, 175 secs
lola: 24873828 markings, 101000876 edges, 115089 markings/sec, 180 secs
lola: 25427414 markings, 103349137 edges, 110717 markings/sec, 185 secs
lola: 25970193 markings, 105679488 edges, 108556 markings/sec, 190 secs
lola: 26493428 markings, 107978644 edges, 104647 markings/sec, 195 secs
lola: 27033136 markings, 110272288 edges, 107942 markings/sec, 200 secs
lola: 27559475 markings, 112568758 edges, 105268 markings/sec, 205 secs
lola: 28090967 markings, 114822074 edges, 106298 markings/sec, 210 secs
lola: 28623616 markings, 117066566 edges, 106530 markings/sec, 215 secs
lola: 29116505 markings, 119276234 edges, 98578 markings/sec, 220 secs
lola: 29626698 markings, 121492720 edges, 102039 markings/sec, 225 secs
lola: 30158749 markings, 123733905 edges, 106410 markings/sec, 230 secs
lola: 30661101 markings, 125878715 edges, 100470 markings/sec, 235 secs
lola: 31169103 markings, 128054294 edges, 101600 markings/sec, 240 secs
lola: 31690618 markings, 130264750 edges, 104303 markings/sec, 245 secs
lola: 32181176 markings, 132414177 edges, 98112 markings/sec, 250 secs
lola: 32691632 markings, 134623410 edges, 102091 markings/sec, 255 secs
lola: 33194969 markings, 136816372 edges, 100667 markings/sec, 260 secs
lola: 33679042 markings, 138970241 edges, 96815 markings/sec, 265 secs
lola: 34170977 markings, 141128799 edges, 98387 markings/sec, 270 secs
lola: 34677183 markings, 143307584 edges, 101241 markings/sec, 275 secs
lola: 35171872 markings, 145464078 edges, 98938 markings/sec, 280 secs
lola: 35681342 markings, 147666557 edges, 101894 markings/sec, 285 secs
lola: 36181805 markings, 149820503 edges, 100093 markings/sec, 290 secs
lola: 36688052 markings, 151985536 edges, 101249 markings/sec, 295 secs
lola: 37192068 markings, 154160578 edges, 100803 markings/sec, 300 secs
lola: 37703917 markings, 156347863 edges, 102370 markings/sec, 305 secs
lola: 38182909 markings, 158438614 edges, 95798 markings/sec, 310 secs
lola: 38680408 markings, 160574766 edges, 99500 markings/sec, 315 secs
lola: 39177824 markings, 162747986 edges, 99483 markings/sec, 320 secs
lola: 39662536 markings, 164850373 edges, 96942 markings/sec, 325 secs
lola: 40148180 markings, 166991897 edges, 97129 markings/sec, 330 secs
lola: 40619855 markings, 169089515 edges, 94335 markings/sec, 335 secs
lola: 41121417 markings, 171216194 edges, 100312 markings/sec, 340 secs
lola: 41610840 markings, 173345731 edges, 97885 markings/sec, 345 secs
lola: 42104841 markings, 175450208 edges, 98800 markings/sec, 350 secs
lola: 42565753 markings, 177534895 edges, 92182 markings/sec, 355 secs
lola: 43043600 markings, 179629951 edges, 95569 markings/sec, 360 secs
lola: 43534701 markings, 181757665 edges, 98220 markings/sec, 365 secs
lola: 44002339 markings, 183848241 edges, 93528 markings/sec, 370 secs
lola: 44480935 markings, 185966204 edges, 95719 markings/sec, 375 secs
lola: 44962812 markings, 188108481 edges, 96375 markings/sec, 380 secs
lola: 45431816 markings, 190228360 edges, 93801 markings/sec, 385 secs
lola: 45919515 markings, 192356636 edges, 97540 markings/sec, 390 secs
lola: 46403566 markings, 194483108 edges, 96810 markings/sec, 395 secs
lola: 46849292 markings, 196503695 edges, 89145 markings/sec, 400 secs
lola: 47294498 markings, 198490114 edges, 89041 markings/sec, 405 secs
lola: 47773917 markings, 200606710 edges, 95884 markings/sec, 410 secs
lola: 48231430 markings, 202630581 edges, 91503 markings/sec, 415 secs
lola: 48712313 markings, 204720374 edges, 96177 markings/sec, 420 secs
lola: 49193625 markings, 206821116 edges, 96262 markings/sec, 425 secs
lola: 49648141 markings, 208857995 edges, 90903 markings/sec, 430 secs
lola: 50095688 markings, 210866486 edges, 89509 markings/sec, 435 secs
lola: 50560579 markings, 212953146 edges, 92978 markings/sec, 440 secs
lola: 51023989 markings, 215035840 edges, 92682 markings/sec, 445 secs
lola: 51481708 markings, 217090020 edges, 91544 markings/sec, 450 secs
lola: 51785009 markings, 218423840 edges, 60660 markings/sec, 455 secs
lola: 51785474 markings, 218425356 edges, 93 markings/sec, 460 secs
lola: 51786303 markings, 218428588 edges, 166 markings/sec, 465 secs
lola: 51789214 markings, 218442287 edges, 582 markings/sec, 470 secs
lola: 51791979 markings, 218456553 edges, 553 markings/sec, 475 secs
lola: 51797804 markings, 218482305 edges, 1165 markings/sec, 480 secs
lola: 51802048 markings, 218505939 edges, 849 markings/sec, 485 secs
lola: 51803654 markings, 218513742 edges, 321 markings/sec, 490 secs
lola: 51805318 markings, 218520724 edges, 333 markings/sec, 495 secs
lola: 51807080 markings, 218528211 edges, 352 markings/sec, 500 secs
lola: 51808883 markings, 218537326 edges, 361 markings/sec, 505 secs
lola: 51812879 markings, 218555735 edges, 799 markings/sec, 510 secs
lola: 51814546 markings, 218562619 edges, 333 markings/sec, 515 secs
lola: 51815547 markings, 218566953 edges, 200 markings/sec, 520 secs
lola: 51819330 markings, 218581420 edges, 757 markings/sec, 525 secs
lola: 51820590 markings, 218587795 edges, 252 markings/sec, 530 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes yes no unknown yes yes no no no no
lola:
preliminary result: yes no yes no no no yes yes no unknown yes yes no no no no
lola: memory consumption: 22584 KB
lola: time consumption: 872 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589544581309

--------------------
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="Diffusion2D-PT-D05N010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is Diffusion2D-PT-D05N010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tajo-158922839600089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D05N010.tgz
mv Diffusion2D-PT-D05N010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;