Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 3.7K May 14 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 134K May 12 20:42 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 ShieldPPPt-PT-020A-00
FORMULA_NAME ShieldPPPt-PT-020A-01
FORMULA_NAME ShieldPPPt-PT-020A-02
FORMULA_NAME ShieldPPPt-PT-020A-03
FORMULA_NAME ShieldPPPt-PT-020A-04
FORMULA_NAME ShieldPPPt-PT-020A-05
FORMULA_NAME ShieldPPPt-PT-020A-06
FORMULA_NAME ShieldPPPt-PT-020A-07
FORMULA_NAME ShieldPPPt-PT-020A-08
FORMULA_NAME ShieldPPPt-PT-020A-09
FORMULA_NAME ShieldPPPt-PT-020A-10
FORMULA_NAME ShieldPPPt-PT-020A-11
FORMULA_NAME ShieldPPPt-PT-020A-12
FORMULA_NAME ShieldPPPt-PT-020A-13
FORMULA_NAME ShieldPPPt-PT-020A-14
FORMULA_NAME ShieldPPPt-PT-020A-15

=== Now, execution of the tool begins

BK_START 1590895939168

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-020A @ 3570 seconds

FORMULA ShieldPPPt-PT-020A-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020A-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2698
rslt: Output for LTLCardinality @ ShieldPPPt-PT-020A

{
"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": "Sun May 31 03:32:19 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 127
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((1 <= p484) OR X (((p215 <= p78) AND G ((1 <= p484))))))",
"processed_size": 60,
"rewrites": 127
},
"result":
{
"edges": 330,
"markings": 330,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"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 (X (X (X (G ((p55 <= p292)))))))",
"processed_size": 37,
"rewrites": 127
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F (((p255 <= p182) AND F (G ((p182 + 1 <= p255)))))))",
"processed_size": 59,
"rewrites": 127
},
"result":
{
"edges": 329,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"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": "(p216 + 1 <= p159)",
"processed_size": 18,
"rewrites": 129
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 810
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (((1 <= p32) OR F ((p3 <= p375))))",
"processed_size": 36,
"rewrites": 127
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1080
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 5,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (F (G ((F ((((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324)))) AND (F ((p393 <= p398)) OR (((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324))))))))",
"processed_size": 171,
"rewrites": 127
},
"result":
{
"edges": 15,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1620
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1620
},
"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": "(p262 + 1 <= p406)",
"processed_size": 18,
"rewrites": 127
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3240
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p395 + 1 <= p11))))",
"processed_size": 29,
"rewrites": 127
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24660,
"runtime": 872.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((F(*) OR (** OR G(**))))) : TRUE : FALSE : TRUE : (A(G(F(**))) AND A(F(G(*)))) : TRUE : A(X((X(G(**)) OR ((G(**) AND F(G(**))) OR (G(**) AND F((X(G(**)) OR (G(**) AND F(G(**)))))))))) : A(X(TRUE)) : A((** OR X((** AND G(**))))) : A((** OR F(**))) : TRUE : A(X(X(X(X(G(**)))))) : A(X(F((** AND F(G(*)))))) : A(F(G((F((** AND F(*))) AND (F(**) OR (** AND F(*))))))) : (* AND A((F(*) OR G(*)))) : A(F(**))"
},
"net":
{
"arcs": 1446,
"conflict_clusters": 223,
"places": 503,
"places_significant": 282,
"singleton_clusters": 0,
"transitions": 363
},
"result":
{
"preliminary_value": "yes yes no yes no yes unknown yes no yes yes no no no no yes ",
"value": "yes yes no yes no yes unknown yes no yes yes no no 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: 866/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 503
lola: finding significant places
lola: 503 places, 363 transitions, 282 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: LP says that atomic proposition is always false: (3 <= p167)
lola: LP says that atomic proposition is always false: (2 <= p233)
lola: LP says that atomic proposition is always false: (2 <= p233)
lola: LP says that atomic proposition is always false: (3 <= p489)
lola: LP says that atomic proposition is always false: (2 <= p214)
lola: LP says that atomic proposition is always false: (2 <= p214)
lola: LP says that atomic proposition is always false: (2 <= p296)
lola: LP says that atomic proposition is always false: (2 <= p296)
lola: LP says that atomic proposition is always false: (2 <= p102)
lola: LP says that atomic proposition is always false: (3 <= p138)
lola: LP says that atomic proposition is always false: (2 <= p210)
lola: LP says that atomic proposition is always false: (2 <= p466)
lola: A (NOT((X ((G ((p307 <= p45)) AND NOT(((p64 <= p307) OR G ((p64 <= p307)))))) OR ((3 <= p167) AND F ((p307 <= p45)))))) : A ((NOT(G (X (G ((2 <= p233))))) OR (G ((2 <= p233)) AND G ((3 <= p489))))) : A ((G (F ((2 <= p214))) OR ((2 <= p214) AND ((p290 <= p190) U G ((p56 <= p102)))))) : A (NOT(((G ((p495 <= p169)) AND ((2 <= p296) OR G ((p29 <= p274)))) U G (F (G ((2 <= p296))))))) : A (G ((X (F (((p11 <= p395) OR (p312 <= p250)))) AND G (NOT(G (X (F ((p11 <= p395))))))))) : A (F (NOT((G ((p202 <= p167)) U F (((p462 <= p119) AND X (F (X ((2 <= p102)))))))))) : A (X ((G ((p332 <= p76)) U (G ((p172 <= p394)) U G ((X (X ((3 <= p138))) OR X ((p332 <= p76)))))))) : A (G (X (X (NOT(F ((((1 <= p362) U (2 <= p210)) AND ((p333 <= p214) U F ((0 <= p233)))))))))) : A (((1 <= p484) OR (X ((p215 <= p78)) AND X (G ((1 <= p484)))))) : A (((1 <= p32) OR (NOT(((2 <= p466) OR G ((1 <= p32)))) U ((1 <= p32) U F ((p3 <= p375)))))) : A (NOT(G ((p81 + 1 <= 0)))) : A (X (G (X (X (X ((p55 <= p292))))))) : A (F (X (((p255 <= p182) AND (() U NOT(G (F ((p255 <= p182))))))))) : A (F (G ((F ((p393 <= p398)) U (((p424 <= p2) AND (p393 <= p398)) AND NOT(G ((p324 <= p497)))))))) : A (NOT((G ((p183 <= p113)) U (p406 <= p262)))) : A ((((1 <= p311) OR X (F ((p88 <= p99)))) U F ((p159 <= p216))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 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: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (G ((p332 <= p76))) OR ((G ((p172 <= p394)) AND F (G ((p332 <= p76)))) OR (G ((p332 <= p76)) AND F ((X (G ((p332 <= p76))) OR (G ((p172 <= p394)) AND F (G ((p332 <= p76)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (G ((p332 <= p76))) OR ((G ((p172 <= p394)) AND F (G ((p332 <= p76)))) OR (G ((p332 <= p76)) AND F ((X (G ((p332 <= p76))) OR (G ((p172 <= p394)) AND F (G ((p332 <= p76)))))))))))
lola: processed formula length: 188
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 61 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: 610775 markings, 1692477 edges, 122155 markings/sec, 0 secs
lola: 1071703 markings, 3074465 edges, 92186 markings/sec, 5 secs
lola: 1496119 markings, 4397810 edges, 84883 markings/sec, 10 secs
lola: 1911682 markings, 5714987 edges, 83113 markings/sec, 15 secs
lola: 2276338 markings, 6888851 edges, 72931 markings/sec, 20 secs
lola: 2637097 markings, 8055576 edges, 72152 markings/sec, 25 secs
lola: 2989371 markings, 9218187 edges, 70455 markings/sec, 30 secs
lola: 3353958 markings, 10419456 edges, 72917 markings/sec, 35 secs
lola: 3716726 markings, 11628144 edges, 72554 markings/sec, 40 secs
lola: 4115806 markings, 12976604 edges, 79816 markings/sec, 45 secs
lola: 4507205 markings, 14299504 edges, 78280 markings/sec, 50 secs
lola: 4851493 markings, 15463883 edges, 68858 markings/sec, 55 secs
lola: 5182776 markings, 16585630 edges, 66257 markings/sec, 60 secs
lola: 5518171 markings, 17722468 edges, 67079 markings/sec, 65 secs
lola: 5846389 markings, 18849705 edges, 65644 markings/sec, 70 secs
lola: 6168197 markings, 19965315 edges, 64362 markings/sec, 75 secs
lola: 6474602 markings, 21019113 edges, 61281 markings/sec, 80 secs
lola: 6791179 markings, 22114529 edges, 63315 markings/sec, 85 secs
lola: 7111189 markings, 23213040 edges, 64002 markings/sec, 90 secs
lola: 7422678 markings, 24305141 edges, 62298 markings/sec, 95 secs
lola: 7719422 markings, 25354333 edges, 59349 markings/sec, 100 secs
lola: 8007113 markings, 26358654 edges, 57538 markings/sec, 105 secs
lola: 8318885 markings, 27462372 edges, 62354 markings/sec, 110 secs
lola: 8640874 markings, 28590189 edges, 64398 markings/sec, 115 secs
lola: 8986226 markings, 29811325 edges, 69070 markings/sec, 120 secs
lola: 9334801 markings, 31054805 edges, 69715 markings/sec, 125 secs
lola: 9696677 markings, 32334008 edges, 72375 markings/sec, 130 secs
lola: 10096554 markings, 33519669 edges, 79975 markings/sec, 135 secs
lola: 10404338 markings, 34430492 edges, 61557 markings/sec, 140 secs
lola: 10740971 markings, 35472408 edges, 67327 markings/sec, 145 secs
lola: 11095092 markings, 36563651 edges, 70824 markings/sec, 150 secs
lola: 11464304 markings, 37724376 edges, 73842 markings/sec, 155 secs
lola: 11862127 markings, 38969831 edges, 79565 markings/sec, 160 secs
lola: 12239366 markings, 40190106 edges, 75448 markings/sec, 165 secs
lola: 12618897 markings, 41425276 edges, 75906 markings/sec, 170 secs
lola: 13012432 markings, 42712367 edges, 78707 markings/sec, 175 secs
lola: 13397195 markings, 43996781 edges, 76953 markings/sec, 180 secs
lola: 13760543 markings, 45223231 edges, 72670 markings/sec, 185 secs
lola: 14139053 markings, 46482982 edges, 75702 markings/sec, 190 secs
lola: 14515310 markings, 47755922 edges, 75251 markings/sec, 195 secs
lola: 14901813 markings, 49071765 edges, 77301 markings/sec, 200 secs
lola: 15284657 markings, 50389321 edges, 76569 markings/sec, 205 secs
lola: 15666887 markings, 51694878 edges, 76446 markings/sec, 210 secs
lola: 16049590 markings, 53016974 edges, 76541 markings/sec, 215 secs
lola: 16427102 markings, 54323184 edges, 75502 markings/sec, 220 secs
lola: 16811119 markings, 55653897 edges, 76803 markings/sec, 225 secs
lola: 17195501 markings, 56990391 edges, 76876 markings/sec, 230 secs
lola: 17580283 markings, 58329560 edges, 76956 markings/sec, 235 secs
lola: 17965021 markings, 59681450 edges, 76948 markings/sec, 240 secs
lola: 18345803 markings, 61029502 edges, 76156 markings/sec, 245 secs
lola: 18726012 markings, 62375532 edges, 76042 markings/sec, 250 secs
lola: 19102155 markings, 63718142 edges, 75229 markings/sec, 255 secs
lola: 19477592 markings, 65051558 edges, 75087 markings/sec, 260 secs
lola: 19852488 markings, 66384448 edges, 74979 markings/sec, 265 secs
lola: 20230737 markings, 67729444 edges, 75650 markings/sec, 270 secs
lola: 20603361 markings, 69063966 edges, 74525 markings/sec, 275 secs
lola: 20972748 markings, 70389742 edges, 73877 markings/sec, 280 secs
lola: 21346112 markings, 71731349 edges, 74673 markings/sec, 285 secs
lola: 21715150 markings, 73065390 edges, 73808 markings/sec, 290 secs
lola: 22086219 markings, 74402558 edges, 74214 markings/sec, 295 secs
lola: 22457636 markings, 75739145 edges, 74283 markings/sec, 300 secs
lola: 22828780 markings, 77082933 edges, 74229 markings/sec, 305 secs
lola: 23197255 markings, 78430773 edges, 73695 markings/sec, 310 secs
lola: 23560870 markings, 79753076 edges, 72723 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes no yes unknown yes unknown unknown unknown unknown yes unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p484) OR X (((p215 <= p78) AND G ((1 <= p484))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p484) OR X (((p215 <= p78) AND G ((1 <= p484))))))
lola: processed formula length: 60
lola: 127 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: 330 markings, 330 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p45 + 1 <= p307)) OR ((p64 <= p307) OR G ((p64 <= p307))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p45 + 1 <= p307)) OR ((p64 <= p307) OR G ((p64 <= p307))))))
lola: processed formula length: 71
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X (G ((p55 <= p292)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X (G ((p55 <= p292)))))))
lola: processed formula length: 37
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 329 markings, 329 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p255 <= p182) AND F (G ((p182 + 1 <= p255)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p255 <= p182) AND F (G ((p182 + 1 <= p255)))))))
lola: processed formula length: 59
lola: 127 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: 329 markings, 329 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p159 <= p216)))
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: (p216 + 1 <= p159)
lola: processed formula length: 18
lola: 129 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p32) OR F ((p3 <= p375))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p32) OR F ((p3 <= p375))))
lola: processed formula length: 36
lola: 127 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: 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 13 will run for 1080 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324)))) AND (F ((p393 <= p398)) OR (((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324)))) AND (F ((p393 <= p398)) OR (((p424 <= p2) AND (p393 <= p398)) AND F ((p497 + 1 <= p324))))))))
lola: processed formula length: 171
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p262 + 1 <= p406) AND A ((F ((p113 + 1 <= p183)) OR G ((p262 + 1 <= p406)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p262 + 1 <= p406)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p262 + 1 <= p406)
lola: processed formula length: 18
lola: 127 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((p11 <= p395) OR (p312 <= p250))))) AND A (F (G ((p395 + 1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p395 + 1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p395 + 1 <= p11))))
lola: processed formula length: 29
lola: 127 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: 9 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((X (G ((p332 <= p76))) OR ((G ((p172 <= p394)) AND F (G ((p332 <= p76)))) OR (G ((p332 <= p76)) AND F ((X (G ((p332 <= p76))) OR (G ((p172 <= p394)) AND F (G ((p332 <= p76)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (G ((p332 <= p76))) OR ((G ((p172 <= p394)) AND F (G ((p332 <= p76)))) OR (G ((p332 <= p76)) AND F ((X (G ((p332 <= p76))) OR (G ((p172 <= p394)) AND F (G ((p332 <= p76)))))))))))
lola: processed formula length: 188
lola: 127 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 61 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: 560639 markings, 1544472 edges, 112128 markings/sec, 0 secs
lola: 1022818 markings, 2923254 edges, 92436 markings/sec, 5 secs
lola: 1452533 markings, 4258055 edges, 85943 markings/sec, 10 secs
lola: 1846083 markings, 5510672 edges, 78710 markings/sec, 15 secs
lola: 2224250 markings, 6714985 edges, 75633 markings/sec, 20 secs
lola: 2592725 markings, 7913114 edges, 73695 markings/sec, 25 secs
lola: 2949392 markings, 9083443 edges, 71333 markings/sec, 30 secs
lola: 3291937 markings, 10215240 edges, 68509 markings/sec, 35 secs
lola: 3636752 markings, 11363920 edges, 68963 markings/sec, 40 secs
lola: 3980005 markings, 12514773 edges, 68651 markings/sec, 45 secs
lola: 4316360 markings, 13651007 edges, 67271 markings/sec, 50 secs
lola: 4645769 markings, 14769314 edges, 65882 markings/sec, 55 secs
lola: 4973444 markings, 15876886 edges, 65535 markings/sec, 60 secs
lola: 5294462 markings, 16966900 edges, 64204 markings/sec, 65 secs
lola: 5618120 markings, 18065054 edges, 64732 markings/sec, 70 secs
lola: 5935939 markings, 19158198 edges, 63564 markings/sec, 75 secs
lola: 6248260 markings, 20243382 edges, 62464 markings/sec, 80 secs
lola: 6553404 markings, 21292287 edges, 61029 markings/sec, 85 secs
lola: 6861530 markings, 22356390 edges, 61625 markings/sec, 90 secs
lola: 7171316 markings, 23426349 edges, 61957 markings/sec, 95 secs
lola: 7472002 markings, 24481182 edges, 60137 markings/sec, 100 secs
lola: 7772106 markings, 25540256 edges, 60021 markings/sec, 105 secs
lola: 8061397 markings, 26550253 edges, 57858 markings/sec, 110 secs
lola: 8354560 markings, 27587728 edges, 58633 markings/sec, 115 secs
lola: 8632929 markings, 28561573 edges, 55674 markings/sec, 120 secs
lola: 8922279 markings, 29584485 edges, 57870 markings/sec, 125 secs
lola: 9202508 markings, 30585616 edges, 56046 markings/sec, 130 secs
lola: 9470479 markings, 31535259 edges, 53594 markings/sec, 135 secs
lola: 9749879 markings, 32525685 edges, 55880 markings/sec, 140 secs
lola: 10159263 markings, 33705711 edges, 81877 markings/sec, 145 secs
lola: 10559835 markings, 34909187 edges, 80114 markings/sec, 150 secs
lola: 10958184 markings, 36148268 edges, 79670 markings/sec, 155 secs
lola: 11373041 markings, 37430156 edges, 82971 markings/sec, 160 secs
lola: 11783068 markings, 38711913 edges, 82005 markings/sec, 165 secs
lola: 12179036 markings, 39989339 edges, 79194 markings/sec, 170 secs
lola: 12575622 markings, 41284443 edges, 79317 markings/sec, 175 secs
lola: 12974380 markings, 42586794 edges, 79752 markings/sec, 180 secs
lola: 13369692 markings, 43903338 edges, 79062 markings/sec, 185 secs
lola: 13745497 markings, 45175015 edges, 75161 markings/sec, 190 secs
lola: 14127547 markings, 46442749 edges, 76410 markings/sec, 195 secs
lola: 14498549 markings, 47700347 edges, 74200 markings/sec, 200 secs
lola: 14872915 markings, 48973349 edges, 74873 markings/sec, 205 secs
lola: 15242892 markings, 50247127 edges, 73995 markings/sec, 210 secs
lola: 15619774 markings, 51532420 edges, 75376 markings/sec, 215 secs
lola: 15991176 markings, 52817803 edges, 74280 markings/sec, 220 secs
lola: 16352657 markings, 54066733 edges, 72296 markings/sec, 225 secs
lola: 16713261 markings, 55316489 edges, 72121 markings/sec, 230 secs
lola: 17075009 markings, 56570230 edges, 72350 markings/sec, 235 secs
lola: 17454872 markings, 57894079 edges, 75973 markings/sec, 240 secs
lola: 17835173 markings, 59226542 edges, 76060 markings/sec, 245 secs
lola: 18213775 markings, 60564004 edges, 75720 markings/sec, 250 secs
lola: 18592060 markings, 61901737 edges, 75657 markings/sec, 255 secs
lola: 18970555 markings, 63242641 edges, 75699 markings/sec, 260 secs
lola: 19349601 markings, 64597765 edges, 75809 markings/sec, 265 secs
lola: 19725828 markings, 65932617 edges, 75245 markings/sec, 270 secs
lola: 20103709 markings, 67276998 edges, 75576 markings/sec, 275 secs
lola: 20477105 markings, 68610499 edges, 74679 markings/sec, 280 secs
lola: 20847326 markings, 69940164 edges, 74044 markings/sec, 285 secs
lola: 21216719 markings, 71263606 edges, 73879 markings/sec, 290 secs
lola: 21586300 markings, 72600157 edges, 73916 markings/sec, 295 secs
lola: 21955605 markings, 73933283 edges, 73861 markings/sec, 300 secs
lola: 22324791 markings, 75255790 edges, 73837 markings/sec, 305 secs
lola: 22692851 markings, 76591720 edges, 73612 markings/sec, 310 secs
lola: 23058765 markings, 77925885 edges, 73183 markings/sec, 315 secs
lola: 23423587 markings, 79253039 edges, 72964 markings/sec, 320 secs
lola: 23786066 markings, 80577108 edges, 72496 markings/sec, 325 secs
lola: 24145873 markings, 81894896 edges, 71961 markings/sec, 330 secs
lola: 24505707 markings, 83210494 edges, 71967 markings/sec, 335 secs
lola: 24864132 markings, 84526877 edges, 71685 markings/sec, 340 secs
lola: 25205597 markings, 85773977 edges, 68293 markings/sec, 345 secs
lola: 25547497 markings, 87035650 edges, 68380 markings/sec, 350 secs
lola: 25894215 markings, 88308243 edges, 69344 markings/sec, 355 secs
lola: 26250350 markings, 89627709 edges, 71227 markings/sec, 360 secs
lola: 26598589 markings, 90916720 edges, 69648 markings/sec, 365 secs
lola: 26932080 markings, 92146874 edges, 66698 markings/sec, 370 secs
lola: 27271944 markings, 93404255 edges, 67973 markings/sec, 375 secs
lola: 27636581 markings, 94601893 edges, 72927 markings/sec, 380 secs
lola: 28005240 markings, 95670880 edges, 73732 markings/sec, 385 secs
lola: 28411187 markings, 96840428 edges, 81189 markings/sec, 390 secs
lola: 28854048 markings, 98140514 edges, 88572 markings/sec, 395 secs
lola: 29279962 markings, 99440204 edges, 85183 markings/sec, 400 secs
lola: 29714195 markings, 100772445 edges, 86847 markings/sec, 405 secs
lola: 30126986 markings, 102067797 edges, 82558 markings/sec, 410 secs
lola: 30519906 markings, 103338308 edges, 78584 markings/sec, 415 secs
lola: 30907704 markings, 104602430 edges, 77560 markings/sec, 420 secs
lola: 31275861 markings, 105808178 edges, 73631 markings/sec, 425 secs
lola: 31622727 markings, 107059090 edges, 69373 markings/sec, 430 secs
lola: 31966518 markings, 108338226 edges, 68758 markings/sec, 435 secs
lola: 32308845 markings, 109604058 edges, 68465 markings/sec, 440 secs
lola: 32669287 markings, 110830210 edges, 72088 markings/sec, 445 secs
lola: 33010458 markings, 112096942 edges, 68234 markings/sec, 450 secs
lola: 33351851 markings, 113302690 edges, 68279 markings/sec, 455 secs
lola: 33731730 markings, 114560056 edges, 75976 markings/sec, 460 secs
lola: 34110317 markings, 115825856 edges, 75717 markings/sec, 465 secs
lola: 34478074 markings, 117073540 edges, 73551 markings/sec, 470 secs
lola: 34834222 markings, 118274233 edges, 71230 markings/sec, 475 secs
lola: 35183794 markings, 119476872 edges, 69914 markings/sec, 480 secs
lola: 35539740 markings, 120695152 edges, 71189 markings/sec, 485 secs
lola: 35858029 markings, 121882189 edges, 63658 markings/sec, 490 secs
lola: 36176709 markings, 123069691 edges, 63736 markings/sec, 495 secs
lola: 36502360 markings, 124287083 edges, 65130 markings/sec, 500 secs
lola: 36824113 markings, 125491196 edges, 64351 markings/sec, 505 secs
lola: 37158379 markings, 126740329 edges, 66853 markings/sec, 510 secs
lola: 37484906 markings, 127874214 edges, 65305 markings/sec, 515 secs
lola: 37814693 markings, 129047516 edges, 65957 markings/sec, 520 secs
lola: 38127645 markings, 130222545 edges, 62590 markings/sec, 525 secs
lola: 38456480 markings, 131458104 edges, 65767 markings/sec, 530 secs
lola: 38732946 markings, 132496600 edges, 55293 markings/sec, 535 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes unknown yes no yes yes no no no no yes
lola:
preliminary result: yes yes no yes no yes unknown yes no yes yes no no no no yes
lola: memory consumption: 24660 KB
lola: time consumption: 872 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590896811873

--------------------
content from stderr:

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="ShieldPPPt-PT-020A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is ShieldPPPt-PT-020A, 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 r221-tajo-159033502000167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-020A.tgz
mv ShieldPPPt-PT-020A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;