Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r016-csrt-155225064900040.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Angiogenesis-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-csrt-155225064900040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.4K Feb 9 06:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 9 06:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 5 03:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 4 22:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 4 22:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 2 00:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 2 00:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Jan 29 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 29 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 33K 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 Angiogenesis-PT-20-CTLCardinality-00
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-01
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-02
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-03
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-04
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-05
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-06
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-07
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-08
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-09
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-10
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-11
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-12
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-13
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-14
FORMULA_NAME Angiogenesis-PT-20-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552500388400

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ Angiogenesis-PT-20 @ 3570 seconds

FORMULA Angiogenesis-PT-20-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Angiogenesis-PT-20-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for CTLCardinality @ Angiogenesis-PT-20

{
"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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Mar 13 18:06:28 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 20
},
"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": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AG(EX(((2 <= KdStarG) OR (KdStarGStarPgStar <= GStarP3kP3))))",
"processed_size": 62,
"rewrites": 22
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 30610,
"markings": 14377,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 <= Akt)))",
"processed_size": 18,
"rewrites": 22
},
"result":
{
"edges": 64,
"markings": 46,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"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": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((1 <= GStarP3)))",
"processed_size": 22,
"rewrites": 21
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= KdStarGStarPgStarP3)))",
"processed_size": 34,
"rewrites": 21
},
"result":
{
"edges": 1741,
"markings": 1109,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"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": 0,
"aneg": 1,
"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 ((KdStarGStarP3kStarP3 <= 0)))",
"processed_size": 35,
"rewrites": 22
},
"result":
{
"edges": 10,
"markings": 11,
"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": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= KdStarGStarP3kStarP2)))",
"processed_size": 35,
"rewrites": 21
},
"result":
{
"edges": 554,
"markings": 371,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "((KdStarGStarP3kP3 <= KdStarGStarP3k) OR (1 <= Pten))",
"processed_size": 54,
"rewrites": 23
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 598
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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(((3 <= KdStarGP3) AND (1 <= PtP2) AND ((KdStar <= KdStarGStarPgStar) OR (1 <= KdStarGStarPg))) U AG((3 <= Akt)))",
"processed_size": 115,
"rewrites": 22
},
"net":
{
"conflict_clusters": 19,
"singleton_clusters": 0
},
"result":
{
"edges": 6525931,
"markings": 3231315,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 746
},
"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": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 995
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((KdStarPgStar <= GP3) AND (2 <= DAGE)) U (KdStarGStarPgStarP3P2 <= PtP2)))",
"processed_size": 79,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 995
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((KdStarPgStarP2 <= Pip2) OR (GStarPgP3 + 1 <= GStarP3kP3))",
"processed_size": 60,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1492
},
"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 ((KdStarGStarPgStarP3P2 <= GP3)))",
"processed_size": 38,
"rewrites": 22
},
"result":
{
"edges": 127,
"markings": 88,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 18808,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(F(*)) OR (E(F(**)) AND **)) : A(G(*)) : A(G(E(X(**)))) : A(G(**)) : E(F(**)) : E(F(**)) : (A((** U **)) AND NODEADLOCK) : A(G(E(F(**)))) : TRUE : E((** U A(G(**)))) : E(F(**)) : (A(G(**)) AND **) : E((E(F(**)) U **)) : ((** OR (A(F(**)) OR E(G(**)))) AND A(G(**))) : E(F(A(G(*)))) : E(F(**))"
},
"net":
{
"arcs": 185,
"conflict_clusters": 19,
"places": 39,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"interim_value": "unknown no no no yes yes yes yes yes no yes no unknown unknown unknown yes ",
"preliminary_value": "unknown no no no yes yes yes yes yes no yes no unknown unknown unknown yes "
},
"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: 103/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 64 transitions, 31 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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (KdStarGStar <= P3k)
lola: LP says that atomic proposition is always true: (AktP3 <= Enz)
lola: (NOT(A (G (((KdStarGStarP3kStarP3P2 <= AktStar) OR (1 <= AktP3))))) OR (E (F ((2 <= Akt))) AND (2 <= PtP3P2))) : NOT(E (F ((1 <= KdStarGStarP3kStarP3)))) : A (G (E (X (((2 <= KdStarG) OR (KdStarGStarPgStar <= GStarP3kP3)))))) : A (G (E (G ((1 <= Akt))))) : E (F ((1 <= GStarP3))) : A (((Pg <= AktP3) U E (F ((3 <= KdStarGStarPgStarP3))))) : (A ((((KdStarPgStar <= GP3) AND (2 <= DAGE)) U (KdStarGStarPgStarP3P2 <= PtP2))) AND E (X (A (G ((KdStarGStar <= P3k)))))) : A (G (E (F (((KdStarGStarP3kP3 <= KdStarGStarP3k) OR (1 <= Pten)))))) : A (G ((0 <= 0))) : E ((((3 <= KdStarGP3) AND (1 <= PtP2) AND ((KdStar <= KdStarGStarPgStar) OR (1 <= KdStarGStarPg))) U A (G ((3 <= Akt))))) : E (F ((2 <= KdStarGStarP3kStarP2))) : (A (G ((KdStarGStarPgStarP3P2 <= GP3))) AND ((KdStarPgStarP2 <= Pip2) OR (GStarPgP3 + 1 <= GStarP3kP3))) : E ((E (F ((KdStarGStarP3 <= KdStarGStar))) U ((2 <= KdStarGStarPgStarP3P2) AND (2 <= KdStarGP3) AND (3 <= Pip3)))) : (((((KdStarGStarP3 <= 1) OR (Pten <= 2)) AND ((KdStarGStarPgStarP3 <= 2))) OR (A (F ((KdStarG <= PtP3))) OR E (G ((Pip3 <= GP3))))) AND A (G ((PtP2 <= Pg)))) : NOT(A (G (E (F ((AktP3 <= KdStarGStarPgStar)))))) : E (F ((1 <= KdStarGStarP3kStarP3)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: 20 rewrites
lola: closed formula file CTLCardinality.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: A (G (E (X (((2 <= KdStarG) OR (KdStarGStarPgStar <= GStarP3kP3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX(((2 <= KdStarG) OR (KdStarGStarPgStar <= GStarP3kP3))))
lola: processed formula length: 62
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14377 markings, 30610 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Akt)))
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 <= Akt)))
lola: processed formula length: 18
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (Akt <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 64 edges
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= GStarP3)))
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 <= GStarP3)))
lola: processed formula length: 22
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: formula 0: (1 <= GStarP3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((3 <= KdStarGStarPgStarP3)))
lola: processed formula length: 34
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= KdStarGStarPgStarP3)
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 CTLCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1109 markings, 1741 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarGStarP3kStarP3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((KdStarGStarP3kStarP3 <= 0)))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLCardinality.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= KdStarGStarP3kStarP3)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= KdStarGStarP3kStarP2)))
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 <= KdStarGStarP3kStarP2)))
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file CTLCardinality.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 <= KdStarGStarP3kStarP2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 371 markings, 554 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= KdStarGStarP3kStarP3)))
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 <= KdStarGStarP3kStarP3)))
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file CTLCardinality.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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= KdStarGStarP3kStarP3)
lola: state equation task get result unparse finished id 0
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((KdStarGStarPgStar + 1 <= AktP3)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (AktP3 <= KdStarGStarPgStar)
lola: processed formula length: 28
lola: 24 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (KdStarGStarPgStar + 1 <= AktP3)
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 CTLCardinality-8-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (AktP3 <= KdStarGStarPgStar)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-1.sara.
sara: try reading problem file CTLCardinality-8-0.sara.


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3059886 markings, 6181080 edges, 611977 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6024952 markings, 12382738 edges, 593013 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8983745 markings, 18620962 edges, 591759 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11622334 markings, 24197567 edges, 527718 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13993465 markings, 29244344 edges, 474226 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16466879 markings, 34343001 edges, 494683 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18880743 markings, 39372193 edges, 482773 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 21209837 markings, 44237511 edges, 465819 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23468851 markings, 48929591 edges, 451803 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25888349 markings, 53886260 edges, 483900 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28325914 markings, 58975826 edges, 487513 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30551515 markings, 63617377 edges, 445120 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32824601 markings, 68426540 edges, 454617 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35090456 markings, 73147524 edges, 453171 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37220319 markings, 77649299 edges, 425973 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39373963 markings, 82266538 edges, 430729 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 41514033 markings, 86792213 edges, 428014 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 43640008 markings, 91260162 edges, 425195 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 45749026 markings, 95704806 edges, 421804 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 47857151 markings, 100140851 edges, 421625 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 49936043 markings, 104505266 edges, 415778 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 52014406 markings, 108932622 edges, 415673 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 54119585 markings, 113363711 edges, 421036 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 56359341 markings, 117945777 edges, 447951 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 58427655 markings, 122331172 edges, 413663 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 60553352 markings, 126773105 edges, 425139 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 62865603 markings, 131575909 edges, 462450 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 65034254 markings, 136029414 edges, 433730 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 67090007 markings, 140302958 edges, 411151 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 69133760 markings, 144609119 edges, 408751 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 71243413 markings, 148954916 edges, 421931 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 73219326 markings, 153183767 edges, 395183 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 75375963 markings, 157665161 edges, 431327 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 77405828 markings, 161931875 edges, 405973 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 79492732 markings, 166371907 edges, 417381 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 81537860 markings, 170587856 edges, 409026 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 83560676 markings, 174933240 edges, 404563 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 85579682 markings, 179178287 edges, 403801 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 87521451 markings, 183390109 edges, 388354 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 89534620 markings, 187569832 edges, 402634 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 91499407 markings, 191719448 edges, 392957 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 93498130 markings, 195827754 edges, 399745 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 95545848 markings, 200051642 edges, 409544 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 97512126 markings, 204224249 edges, 393256 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 99639440 markings, 208554398 edges, 425463 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 101592166 markings, 212727065 edges, 390545 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 103682895 markings, 217053605 edges, 418146 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 105705357 markings, 221284419 edges, 404492 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 107706793 markings, 225575892 edges, 400287 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 109665838 markings, 229677720 edges, 391809 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 111617495 markings, 233829424 edges, 390331 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 113613470 markings, 237999408 edges, 399195 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 113734757 markings, 238239017 edges, 24257 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 113801286 markings, 238388646 edges, 13306 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 113803467 markings, 238393087 edges, 436 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 113812641 markings, 238409112 edges, 1835 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 113812776 markings, 238409357 edges, 27 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((KdStarGStarP3kP3 <= KdStarGStarP3k) OR (1 <= Pten))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((KdStarGStarP3kP3 <= KdStarGStarP3k) OR (1 <= Pten))
lola: processed formula length: 54
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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: ((KdStarGStarP3k + 1 <= KdStarGStarP3kP3) AND (Pten <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((KdStarGStarP3kP3 <= KdStarGStarP3k) OR (1 <= Pten))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
sara: try reading problem file CTLCardinality-9-0.sara.


lola: state equation 1: solution produced
lola: state equation: solution impossible
lola: SUBRESULT
lola: Quick check says:
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((KdStarGStarP3 <= KdStarGStar))) U ((2 <= KdStarGStarPgStarP3P2) AND (2 <= KdStarGP3) AND (3 <= Pip3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: ========================================
lola: processed formula: E(EF((KdStarGStarP3 <= KdStarGStar)) U ((2 <= KdStarGStarPgStarP3P2) AND (2 <= KdStarGP3) AND (3 <= Pip3)))
lola: processed formula length: 107
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2109914 markings, 6364008 edges, 421983 markings/sec, 0 secs
lola: 4030434 markings, 12220472 edges, 384104 markings/sec, 5 secs
lola: 5859363 markings, 17943700 edges, 365786 markings/sec, 10 secs
lola: 7581954 markings, 23314486 edges, 344518 markings/sec, 15 secs
lola: 9267050 markings, 28557799 edges, 337019 markings/sec, 20 secs
lola: 10916430 markings, 33656808 edges, 329876 markings/sec, 25 secs
lola: 12587067 markings, 38834623 edges, 334127 markings/sec, 30 secs
lola: 14197416 markings, 43834904 edges, 322070 markings/sec, 35 secs
lola: 15830444 markings, 48940161 edges, 326606 markings/sec, 40 secs
lola: 17485415 markings, 54049139 edges, 330994 markings/sec, 45 secs
lola: 19156338 markings, 59166555 edges, 334185 markings/sec, 50 secs
lola: 20846759 markings, 64429141 edges, 338084 markings/sec, 55 secs
lola: 22447097 markings, 69443370 edges, 320068 markings/sec, 60 secs
lola: 24017382 markings, 74264052 edges, 314057 markings/sec, 65 secs
lola: 25566839 markings, 79050454 edges, 309891 markings/sec, 70 secs
lola: 27124264 markings, 83935223 edges, 311485 markings/sec, 75 secs
lola: 28682582 markings, 88749598 edges, 311664 markings/sec, 80 secs
lola: 30258028 markings, 93530476 edges, 315089 markings/sec, 85 secs
lola: 31871343 markings, 98530066 edges, 322663 markings/sec, 90 secs
lola: 33569989 markings, 103784842 edges, 339729 markings/sec, 95 secs
lola: 35124817 markings, 108643873 edges, 310966 markings/sec, 100 secs
lola: 36710538 markings, 113635711 edges, 317144 markings/sec, 105 secs
lola: 38278823 markings, 118513419 edges, 313657 markings/sec, 110 secs
lola: 39892073 markings, 123421003 edges, 322650 markings/sec, 115 secs
lola: 41481972 markings, 128220574 edges, 317980 markings/sec, 120 secs
lola: 43056792 markings, 133142028 edges, 314964 markings/sec, 125 secs
lola: 44560152 markings, 137776824 edges, 300672 markings/sec, 130 secs
lola: 46061111 markings, 142486991 edges, 300192 markings/sec, 135 secs
lola: 47700911 markings, 147625507 edges, 327960 markings/sec, 140 secs
lola: 49279816 markings, 152451113 edges, 315781 markings/sec, 145 secs
lola: 50765059 markings, 157102775 edges, 297049 markings/sec, 150 secs
lola: 52276553 markings, 161722174 edges, 302299 markings/sec, 155 secs
lola: 53788290 markings, 166366636 edges, 302347 markings/sec, 160 secs
lola: 55311423 markings, 171213504 edges, 304627 markings/sec, 165 secs
lola: 56804906 markings, 175883782 edges, 298697 markings/sec, 170 secs
lola: 58355232 markings, 180653676 edges, 310065 markings/sec, 175 secs
lola: 59943976 markings, 185644348 edges, 317749 markings/sec, 180 secs
lola: 61595535 markings, 190722321 edges, 330312 markings/sec, 185 secs
lola: 63231645 markings, 195773329 edges, 327222 markings/sec, 190 secs
lola: 64916451 markings, 200908389 edges, 336961 markings/sec, 195 secs
lola: 66546277 markings, 205958263 edges, 325965 markings/sec, 200 secs
lola: 68198040 markings, 211027291 edges, 330353 markings/sec, 205 secs
lola: 69743451 markings, 215890375 edges, 309082 markings/sec, 210 secs
lola: 71407152 markings, 220993182 edges, 332740 markings/sec, 215 secs
lola: 73045489 markings, 226020671 edges, 327667 markings/sec, 220 secs
lola: 74633188 markings, 231005476 edges, 317540 markings/sec, 225 secs
lola: 76190672 markings, 235982802 edges, 311497 markings/sec, 230 secs
lola: 77759495 markings, 240917209 edges, 313765 markings/sec, 235 secs
lola: 79242831 markings, 245510206 edges, 296667 markings/sec, 240 secs
lola: 80694810 markings, 250138158 edges, 290396 markings/sec, 245 secs
lola: 82196145 markings, 254712507 edges, 300267 markings/sec, 250 secs
lola: 83822615 markings, 259691258 edges, 325294 markings/sec, 255 secs
lola: 85391712 markings, 264670613 edges, 313819 markings/sec, 260 secs
lola: 86971301 markings, 269626030 edges, 315918 markings/sec, 265 secs
lola: 88495824 markings, 274317995 edges, 304905 markings/sec, 270 secs
lola: 90080119 markings, 279199111 edges, 316859 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 598 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= KdStarGP3) AND (1 <= PtP2) AND ((KdStar <= KdStarGStarPgStar) OR (1 <= KdStarGStarPg))) U A (G ((3 <= Akt)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((3 <= KdStarGP3) AND (1 <= PtP2) AND ((KdStar <= KdStarGStarPgStar) OR (1 <= KdStarGStarPg))) U AG((3 <= Akt)))
lola: processed formula length: 115
lola: 22 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2912806 markings, 5884616 edges, 582561 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3231315 markings, 6525931 edges
lola: ========================================
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((KdStarPgStar <= GP3) AND (2 <= DAGE)) U (KdStarGStarPgStarP3P2 <= PtP2))) AND NOT DEADLOCK)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLCardinality.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 13 will run for 995 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((KdStarPgStar <= GP3) AND (2 <= DAGE)) U (KdStarGStarPgStarP3P2 <= PtP2)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((KdStarPgStar <= GP3) AND (2 <= DAGE)) U (KdStarGStarPgStarP3P2 <= PtP2)))
lola: processed formula length: 79
lola: 25 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((KdStarPgStar <= GP3) AND (2 <= DAGE))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((KdStarGStarPgStarP3P2 <= GP3))) AND ((KdStarPgStarP2 <= Pip2) OR (GStarPgP3 + 1 <= GStarP3kP3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((KdStarPgStarP2 <= Pip2) OR (GStarPgP3 + 1 <= GStarP3kP3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((KdStarPgStarP2 <= Pip2) OR (GStarPgP3 + 1 <= GStarP3kP3))
lola: processed formula length: 60
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 14 will run for 1492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarGStarPgStarP3P2 <= GP3)))
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 ((KdStarGStarPgStarP3P2 <= GP3)))
lola: processed formula length: 38
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: (GP3 + 1 <= KdStarGStarPgStarP3P2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 88 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((AktStar + 1 <= KdStarGStarP3kStarP3P2) AND (AktP3 <= 0)))) OR (E (F ((2 <= Akt))) AND (2 <= PtP3P2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no no yes yes yes yes yes no yes no unknown unknown unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 18808 KB
lola: time consumption: 2077 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
lola: time limit reached - aborting
lola:
preliminary result: unknown no no no yes yes yes yes yes no yes no unknown unknown unknown yes
lola:
preliminary result: unknown no no no yes yes yes yes yes no yes no unknown unknown unknown yes
lola: memory consumption: 18808 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.json
rslt: finished

BK_STOP 1552503958574

--------------------
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="Angiogenesis-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is Angiogenesis-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r016-csrt-155225064900040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Angiogenesis-PT-20.tgz
mv Angiogenesis-PT-20 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;