Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 3.8K Feb 12 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 8 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 8 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.7K Feb 5 00:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 4 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Feb 4 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 153K 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 QuasiCertifProtocol-PT-06-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1553897367102

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-06 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-06-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3520
rslt: Output for LTLCardinality @ QuasiCertifProtocol-PT-06

{
"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 Mar 29 22:09:27 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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "(n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6)",
"processed_size": 490,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(2 <= SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + SstopOK_1 + SstopOK_0)",
"processed_size": 88,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 49,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "(3 <= n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6)",
"processed_size": 445,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "(AstopOK <= SstopAbort)",
"processed_size": 23,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6))))",
"processed_size": 101,
"rewrites": 18
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G ((n9_6_6 <= n7_0_1))))",
"processed_size": 30,
"rewrites": 18
},
"result":
{
"edges": 1612739,
"markings": 302912,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((n7_4_4 <= n7_1_3)))",
"processed_size": 26,
"rewrites": 20
},
"result":
{
"edges": 21,
"markings": 22,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "A (G ((n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 <= a5)))",
"processed_size": 454,
"rewrites": 20
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(n7_4_1 + 1 <= Sstart_2)",
"processed_size": 24,
"rewrites": 20
},
"result":
{
"edges": 20101,
"markings": 5377,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((Sstart_5 <= n7_0_3))))",
"processed_size": 32,
"rewrites": 18
},
"result":
{
"edges": 17493270,
"markings": 2186612,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 591
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F ((s2_1 <= n9_4_3))))",
"processed_size": 28,
"rewrites": 18
},
"result":
{
"edges": 34689,
"markings": 13222,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"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 (F (G ((n9_6_3 <= s5_4))))",
"processed_size": 28,
"rewrites": 18
},
"result":
{
"edges": 859867,
"markings": 177159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((n7_5_3 <= n8_1_1) OR (G ((n8_0_0 <= n8_6_5)) AND F ((n7_5_3 <= n8_1_1))))))",
"processed_size": 83,
"rewrites": 18
},
"result":
{
"edges": 53602,
"markings": 15792,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"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": 1181
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5))))",
"processed_size": 60,
"rewrites": 18
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1772
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_6))))",
"processed_size": 110,
"rewrites": 18
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 3545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "A (G (F ((n9_0_0 + n9_1_0 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_3 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_5_2 + n9_5_1 + n9_5_0 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_6 + n9_1_5 + n9_1_4 + n9_1_3 + n9_1_2 + n9_1_1 + n9_0_6 + n9_0_5 + n9_0_4 + n9_0_3 + n9_0_2 + n9_0_1 <= a4))))",
"processed_size": 458,
"rewrites": 18
},
"result":
{
"edges": 777776,
"markings": 169043,
"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":
{
"error": null,
"memory": 20660,
"runtime": 26.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F(**))) : A(G(F(**))) : ** : ** : ** : A(X((X(**) U **))) : A(G(**)) : ** : A(G(**)) : A(G(F(**))) : A((** U (** U **))) : A(F(G(**))) : A(F(G(**))) : A(X(G(**))) : A(G((** OR (G(**) AND F(**))))) : A(F(**))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no yes no no no no yes no no yes no yes no no yes ",
"value": "no no yes no no no no yes no no yes no yes no no 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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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 (X (G (F ((n9_0_0 + n9_1_0 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_3 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_5_2 + n9_5_1 + n9_5_0 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_6 + n9_1_5 + n9_1_4 + n9_1_3 + n9_1_2 + n9_1_1 + n9_0_6 + n9_0_5 + n9_0_4 + n9_0_3 + n9_0_2 + n9_0_1 <= a4)))))) : A (G (F (X (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_6)))))) : A ((n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6)) : A ((2 <= SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + SstopOK_1 + SstopOK_0)) : A ((3 <= n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6)) : A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6)))) : A (G ((n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 <= a5))) : A ((AstopOK <= SstopAbort)) : A (G ((n7_4_4 <= n7_1_3))) : A (G (F ((s2_1 <= n9_4_3)))) : A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5)))) : A (G (F (G ((n9_6_3 <= s5_4))))) : A (X (F (F (G ((Sstart_5 <= n7_0_3)))))) : A (G (X (G (G ((n9_6_6 <= n7_0_1)))))) : A (G ((G ((n8_0_0 <= n8_6_5)) U (n7_5_3 <= n8_1_1)))) : A (F (F ((Sstart_2 <= n7_4_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 <= n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 ... (shortened)
lola: processed formula length: 490
lola: 18 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + SstopOK_1 + SstopOK_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_6 + SstopOK_1 + SstopOK_0)
lola: processed formula length: 88
lola: 18 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: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_6_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_2_0 + n7_1_0 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_6_1 ... (shortened)
lola: processed formula length: 445
lola: 18 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: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AstopOK <= SstopAbort)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (AstopOK <= SstopAbort)
lola: processed formula length: 23
lola: 18 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= malicious_reservoir)) U (Astart <= s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6))))
lola: processed formula length: 101
lola: 18 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((n9_6_6 <= n7_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((n9_6_6 <= n7_0_1))))
lola: processed formula length: 30
lola: 18 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: 302912 markings, 1612739 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((n7_4_4 <= n7_1_3)))
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 ((n7_4_4 <= n7_1_3)))
lola: processed formula length: 26
lola: 20 rewrites
lola: closed formula file LTLCardinality.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: (n7_1_3 + 1 <= n7_4_4)
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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1... (shortened)
lola: processed formula length: 454
lola: 20 rewrites
lola: closed formula file LTLCardinality.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: (a5 + 1 <= n8_3_0 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_0 + n8_2_0 + n8_5_0 + n8_1_0 + n8_0_0 + n8_6_0 + n8_6_6 + n8_6_5 + n8_6_4 + n8_6_3 + n8_6_2 + n8_6_1 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_5_2 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_5_1 + n8_4_6 + n8_4_5 + n8_4_4 + n8_4_3 + n8_4_2 + n8_4_1 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Sstart_2 <= n7_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (n7_4_1 + 1 <= Sstart_2)
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 5377 markings, 20101 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Sstart_5 <= n7_0_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Sstart_5 <= n7_0_3))))
lola: processed formula length: 32
lola: 18 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: 738635 markings, 4643919 edges, 147727 markings/sec, 0 secs
lola: 1362242 markings, 9098092 edges, 124721 markings/sec, 5 secs
lola: 1855245 markings, 13871156 edges, 98601 markings/sec, 10 secs
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: 2186612 markings, 17493270 edges
lola: ========================================
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((s2_1 <= n9_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((s2_1 <= n9_4_3))))
lola: processed formula length: 28
lola: 18 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: 13222 markings, 34689 edges
lola: ========================================
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((n9_6_3 <= s5_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((n9_6_3 <= s5_4))))
lola: processed formula length: 28
lola: 18 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: 177159 markings, 859867 edges
lola: ========================================
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((n7_5_3 <= n8_1_1) OR (G ((n8_0_0 <= n8_6_5)) AND F ((n7_5_3 <= n8_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((n7_5_3 <= n8_1_1) OR (G ((n8_0_0 <= n8_6_5)) AND F ((n7_5_3 <= n8_1_1))))))
lola: processed formula length: 83
lola: 18 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: 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: 15792 markings, 53602 edges
lola: ========================================
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((n8_5_3 <= n5_6) U ((s6_6 <= n7_0_3) U (n3_4 <= s2_5))))
lola: processed formula length: 60
lola: 18 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: 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 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 <= s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_6))))
lola: processed formula length: 110
lola: 18 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 15 will run for 3545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((n9_0_0 + n9_1_0 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_3 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_5_2 + n9_5_1 + n9_5_0 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_6 + n9_1_5 + n9_1_4 + n9_1_3 + n9_1_2 + n9_1_1 + n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((n9_0_0 + n9_1_0 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_3 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_5_2 + n9_5_1 + n9_5_0 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_6 + n9_1_5 + n9_1_4 + n9_1_3 + n9_1_2 + n9_1_1 + n9_... (shortened)
lola: processed formula length: 458
lola: 18 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: 169043 markings, 777776 edges
lola: RESULT
lola:
SUMMARY: no no yes no no no no yes no no yes no yes no no yes
lola:
preliminary result: no no yes no no no no yes no no yes no yes no no yes
lola: ========================================
lola: memory consumption: 20660 KB
lola: time consumption: 26 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1553897417716

--------------------
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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLCardinality"
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 QuasiCertifProtocol-PT-06, 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 r126-oct2-155274853400267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "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
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 ;