Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K Apr 8 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 8 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 7 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 16:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 6 19:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 6 19:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 6 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 14K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-05000-00
FORMULA_NAME Kanban-PT-05000-01
FORMULA_NAME Kanban-PT-05000-02
FORMULA_NAME Kanban-PT-05000-03
FORMULA_NAME Kanban-PT-05000-04
FORMULA_NAME Kanban-PT-05000-05
FORMULA_NAME Kanban-PT-05000-06
FORMULA_NAME Kanban-PT-05000-07
FORMULA_NAME Kanban-PT-05000-08
FORMULA_NAME Kanban-PT-05000-09
FORMULA_NAME Kanban-PT-05000-10
FORMULA_NAME Kanban-PT-05000-11
FORMULA_NAME Kanban-PT-05000-12
FORMULA_NAME Kanban-PT-05000-13
FORMULA_NAME Kanban-PT-05000-14
FORMULA_NAME Kanban-PT-05000-15

=== Now, execution of the tool begins

BK_START 1589724212916

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-05000 @ 3570 seconds

FORMULA Kanban-PT-05000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Kanban-PT-05000-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2868
rslt: Output for LTLCardinality @ Kanban-PT-05000

{
"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 17 14:03:32 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((X (((2 <= Pout1) U G ((Pout3 <= Pback2)))) U ((Pback3 <= 0) AND G (F ((Pm3 <= Pm1))))))",
"processed_size": 91,
"rewrites": 93
},
"result":
{
"edges": 65021,
"markings": 65018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 0,
"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": 237
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 4,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((X ((Pm4 + 1 <= P4)) OR (G ((F (((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))) AND (((1 <= Pback1) U (Pm3 <= P1)) OR ((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))))) AND X (F ((Pm4 + 1 <= P4))))))",
"processed_size": 211,
"rewrites": 93
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 24
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 308
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((G ((Pout1 <= 1)) OR ((Pout1 <= 1) AND X (X (X (F ((Pout4 <= 2))))))))",
"processed_size": 73,
"rewrites": 93
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 359
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((Pout3 <= Pm1))))",
"processed_size": 26,
"rewrites": 93
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((X ((3 <= Pout1)) OR F (G ((Pm2 <= Pback2)))))",
"processed_size": 49,
"rewrites": 93
},
"result":
{
"edges": 10014,
"markings": 10010,
"produced_by": "LTL model checker",
"value": false
},
"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": 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": 93
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 539
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((P4 + 1 <= Pm2)))",
"processed_size": 23,
"rewrites": 95
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 647
},
"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 ((Pm4 <= P3)))",
"processed_size": 19,
"rewrites": 95
},
"result":
{
"edges": 5003,
"markings": 5004,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 808
},
"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 ((P1 <= P2))))",
"processed_size": 22,
"rewrites": 93
},
"result":
{
"edges": 20006,
"markings": 15005,
"produced_by": "LTL model checker",
"value": false
},
"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": 1078
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": 3,
"visible_transitions": 0
},
"processed": "A ((F ((Pback3 <= Pout3)) OR (G (F (((3 <= Pm4) OR (Pm4 <= 2)))) AND F ((Pback3 <= Pout3)))))",
"processed_size": 94,
"rewrites": 93
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1617
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"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 (F (((Pm1 <= Pback1) AND F (((Pm2 + 1 <= Pback2) OR F ((Pm1 <= Pm2))))))))",
"processed_size": 79,
"rewrites": 93
},
"result":
{
"edges": 20038,
"markings": 15030,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((Pback4 <= Pout4) U (G ((Pback4 <= Pout4)) AND ((3 <= P3) U (Pm2 <= Pout1)))))",
"processed_size": 82,
"rewrites": 93
},
"result":
{
"edges": 12725111,
"markings": 6382573,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 20924,
"runtime": 678.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((X((** U G(**))) U (** AND G(F(**))))) : (A(X(F(**))) AND A(X(X(G(**))))) : A(G(*)) : A(G(**)) : A(F(G(**))) : A((F(**) OR (G(F(**)) AND F(**)))) : A(X(F(**))) : A((X(*) OR (G((F((** OR (G(**) AND F(**)))) AND ((** U **) OR (** OR (G(**) AND F(**)))))) AND X(F(*))))) : A((** U (G(**) AND (** U **)))) : A(((** U G(**)) OR G((F(**) AND (X(**) OR (** U **)))))) : A((G(*) OR (* AND X(X(X(F(*))))))) : A(G(F((** AND F((** OR F(**))))))) : A(X(X(G((G(*) OR (X(*) R *)))))) : A(X(F(**))) : A((X(**) OR F(G(*)))) : A(X(TRUE))"
},
"net":
{
"arcs": 40,
"conflict_clusters": 12,
"places": 16,
"places_significant": 11,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "no no no no no yes no yes no unknown yes no unknown yes no yes ",
"value": "no no no no no yes no yes no unknown yes no unknown yes 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: 32/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 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 ((X (((2 <= Pout1) U G ((Pout3 <= Pback2)))) U ((Pback3 <= 0) AND F (G (F ((Pm3 <= Pm1))))))) : A ((F (X ((2 <= Pm1))) AND X (X (G (((P4 <= Pm3) OR ((Pout3 + 1 <= P4) AND (2 <= Pm1) AND (P4 <= Pm3)))))))) : A (NOT(F ((F ((1 <= P4)) U (Pm2 <= P4))))) : A (G ((Pm4 <= P3))) : A (F (X (G ((P1 <= P2))))) : A ((G (NOT(F (NOT(X (X (G (F (((3 <= Pm4) OR (Pm4 <= 2)))))))))) U F ((Pback3 <= Pout3)))) : A (X (F ((3 <= Pm3)))) : A ((G ((((1 <= Pback1) U (Pm3 <= P1)) U (G ((1 <= Pm1)) U (1 <= Pm1)))) U NOT(X ((P4 <= Pm4))))) : A (((Pback4 <= Pout4) U (G ((Pback4 <= Pout4)) AND ((3 <= P3) U (Pm2 <= Pout1))))) : A ((((Pback3 + 1 <= Pm2) U G ((2 <= P2))) OR G ((X ((1 <= Pback4)) U ((Pback3 <= Pback1) U (1 <= Pback4)))))) : A (NOT((F ((2 <= Pout1)) AND ((2 <= Pout1) OR X (X (NOT(X (NOT(G ((3 <= Pout4))))))))))) : A (G (F (((Pm1 <= Pback1) AND F (((Pm2 + 1 <= Pback2) OR F ((Pm1 <= Pm2)))))))) : A (X (X (NOT(((3 <= Pback1) U F ((F ((2 <= Pback2)) AND (X ((2 <= Pback2)) U (3 <= Pback1))))))))) : A (X (F ((Pout3 <= Pm1)))) : A (NOT((NOT(X ((3 <= Pout1))) AND NOT(G (NOT(F (NOT(F (NOT(F ((Pback2 + 1 <= Pm2)))))))))))) : A (X (G ((NOT(X (F ((X (G ((0 <= Pback1))) U X ((0 <= Pback1)))))) OR F (G ((0 <= Pback1)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((2 <= Pout1) U G ((Pout3 <= Pback2)))) U ((Pback3 <= 0) AND G (F ((Pm3 <= Pm1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((2 <= Pout1) U G ((Pout3 <= Pback2)))) U ((Pback3 <= 0) AND G (F ((Pm3 <= Pm1))))))
lola: processed formula length: 91
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 65018 markings, 65021 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((2 <= Pm1)))) AND A (X (X (G (((P4 <= Pm3) OR ((Pout3 + 1 <= P4) AND (2 <= Pm1) AND (P4 <= Pm3))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= Pm1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= Pm1))))
lola: processed formula length: 22
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10006 markings, 10006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= Pm3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= Pm3))))
lola: processed formula length: 22
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10006 markings, 10006 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((Pm4 + 1 <= P4)) OR (G ((F (((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))) AND (((1 <= Pback1) U (Pm3 <= P1)) OR ((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))))) AND X (F ((Pm4 + 1 <= P4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((Pm4 + 1 <= P4)) OR (G ((F (((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))) AND (((1 <= Pback1) U (Pm3 <= P1)) OR ((1 <= Pm1) OR (G ((1 <= Pm1)) AND F ((1 <= Pm1))))))) AND X (F ((Pm4 + 1 <= P4))))))
lola: processed formula length: 211
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 24 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((Pback3 + 1 <= Pm2) U G ((2 <= P2))) OR G ((F ((1 <= Pback4)) AND (X ((1 <= Pback4)) OR ((Pback3 <= Pback1) U (1 <= Pback4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pback3 + 1 <= Pm2) U G ((2 <= P2))) OR G ((F ((1 <= Pback4)) AND (X ((1 <= Pback4)) OR ((Pback3 <= Pback1) U (1 <= Pback4)))))))
lola: processed formula length: 134
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 21 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: 4037594 markings, 9921465 edges, 807519 markings/sec, 0 secs
lola: 7608671 markings, 19361466 edges, 714215 markings/sec, 5 secs
lola: 11181304 markings, 28464871 edges, 714527 markings/sec, 10 secs
lola: 14434810 markings, 37180773 edges, 650701 markings/sec, 15 secs
lola: 17806219 markings, 46210821 edges, 674282 markings/sec, 20 secs
lola: 21059523 markings, 54976288 edges, 650661 markings/sec, 25 secs
lola: 24138544 markings, 63243860 edges, 615804 markings/sec, 30 secs
lola: 27241952 markings, 71995983 edges, 620682 markings/sec, 35 secs
lola: 30058258 markings, 80100884 edges, 563261 markings/sec, 40 secs
lola: 32919589 markings, 88097800 edges, 572266 markings/sec, 45 secs
lola: 35651393 markings, 96008900 edges, 546361 markings/sec, 50 secs
lola: 38305870 markings, 103708041 edges, 530895 markings/sec, 55 secs
lola: 40919182 markings, 111344526 edges, 522662 markings/sec, 60 secs
lola: 43579763 markings, 118998728 edges, 532116 markings/sec, 65 secs
lola: 46155077 markings, 126627427 edges, 515063 markings/sec, 70 secs
lola: 48774687 markings, 134279261 edges, 523922 markings/sec, 75 secs
lola: 51098118 markings, 141459790 edges, 464686 markings/sec, 80 secs
lola: 53530865 markings, 148855951 edges, 486549 markings/sec, 85 secs
lola: 55914729 markings, 156149794 edges, 476773 markings/sec, 90 secs
lola: 58361544 markings, 163313349 edges, 489363 markings/sec, 95 secs
lola: 60598882 markings, 170360120 edges, 447468 markings/sec, 100 secs
lola: 62901558 markings, 177460828 edges, 460535 markings/sec, 105 secs
lola: 64943274 markings, 184276152 edges, 408343 markings/sec, 110 secs
lola: 67176334 markings, 191359233 edges, 446612 markings/sec, 115 secs
lola: 69687260 markings, 198665648 edges, 502185 markings/sec, 120 secs
lola: 72101143 markings, 206011592 edges, 482777 markings/sec, 125 secs
lola: 74452613 markings, 213221966 edges, 470294 markings/sec, 130 secs
lola: 76661070 markings, 220253433 edges, 441691 markings/sec, 135 secs
lola: 79065713 markings, 227548669 edges, 480929 markings/sec, 140 secs
lola: 81196074 markings, 234536122 edges, 426072 markings/sec, 145 secs
lola: 83297510 markings, 241308262 edges, 420287 markings/sec, 150 secs
lola: 85285342 markings, 248071026 edges, 397566 markings/sec, 155 secs
lola: 87549154 markings, 255108731 edges, 452762 markings/sec, 160 secs
lola: 88080195 markings, 256753701 edges, 106208 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((Pout1 <= 1)) OR ((Pout1 <= 1) AND X (X (X (F ((Pout4 <= 2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((Pout1 <= 1)) OR ((Pout1 <= 1) AND X (X (X (F ((Pout4 <= 2))))))))
lola: processed formula length: 73
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((G ((Pback2 <= 1)) OR (X ((Pback2 <= 1)) R (Pback1 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((G ((Pback2 <= 1)) OR (X ((Pback2 <= 1)) R (Pback1 <= 2)))))))
lola: processed formula length: 74
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4614921 markings, 9256197 edges, 922984 markings/sec, 0 secs
lola: 8939395 markings, 17900987 edges, 864895 markings/sec, 5 secs
lola: 13155173 markings, 26332955 edges, 843156 markings/sec, 10 secs
lola: 17283579 markings, 34589345 edges, 825681 markings/sec, 15 secs
lola: 21497717 markings, 43012846 edges, 842828 markings/sec, 20 secs
lola: 25644013 markings, 51308823 edges, 829259 markings/sec, 25 secs
lola: 29553709 markings, 59124923 edges, 781939 markings/sec, 30 secs
lola: 33492108 markings, 67004818 edges, 787680 markings/sec, 35 secs
lola: 37566846 markings, 75154571 edges, 814948 markings/sec, 40 secs
lola: 41251108 markings, 82516507 edges, 736852 markings/sec, 45 secs
lola: 45199995 markings, 90412442 edges, 789777 markings/sec, 50 secs
lola: 49167411 markings, 98345481 edges, 793483 markings/sec, 55 secs
lola: 52271509 markings, 104621246 edges, 620820 markings/sec, 60 secs
lola: 54614485 markings, 109306029 edges, 468595 markings/sec, 65 secs
lola: 56670852 markings, 113416979 edges, 411273 markings/sec, 70 secs
lola: 58649226 markings, 117375380 edges, 395675 markings/sec, 75 secs
lola: 60621344 markings, 121318324 edges, 394424 markings/sec, 80 secs
lola: 62548529 markings, 125170267 edges, 385437 markings/sec, 85 secs
lola: 64609813 markings, 129293804 edges, 412257 markings/sec, 90 secs
lola: 66807155 markings, 133687357 edges, 439468 markings/sec, 95 secs
lola: 69001475 markings, 138076637 edges, 438864 markings/sec, 100 secs
lola: 71191918 markings, 142457059 edges, 438089 markings/sec, 105 secs
lola: 73546250 markings, 147167088 edges, 470866 markings/sec, 110 secs
lola: 76387780 markings, 153234657 edges, 568306 markings/sec, 115 secs
lola: 79139323 markings, 160114489 edges, 550309 markings/sec, 120 secs
lola: 81788130 markings, 166739173 edges, 529761 markings/sec, 125 secs
lola: 84258798 markings, 172916163 edges, 494134 markings/sec, 130 secs
lola: 86747918 markings, 179138461 edges, 497824 markings/sec, 135 secs
lola: 89007780 markings, 184790929 edges, 451972 markings/sec, 140 secs
lola: 91218011 markings, 190312417 edges, 442046 markings/sec, 145 secs
lola: 93372545 markings, 195699324 edges, 430907 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Pout3 <= Pm1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Pout3 <= Pm1))))
lola: processed formula length: 26
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= Pout1)) OR F (G ((Pm2 <= Pback2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((3 <= Pout1)) OR F (G ((Pm2 <= Pback2)))))
lola: processed formula length: 49
lola: 93 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: 10010 markings, 10014 edges
lola: ========================================
lola: subprocess 9 will run for 462 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: 93 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 10 will run for 539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P4 + 1 <= Pm2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((P4 + 1 <= Pm2)))
lola: processed formula length: 23
lola: 95 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (Pm2 <= P4)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Pm4 <= P3)))
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 ((Pm4 <= P3)))
lola: processed formula length: 19
lola: 95 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: (P3 + 1 <= Pm4)
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: 5004 markings, 5003 edges
lola: state equation: write sara problem file to LTLCardinality-11-0.sara
lola: subprocess 12 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P1 <= P2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P1 <= P2))))
lola: processed formula length: 22
lola: 93 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: add low 14
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: 15005 markings, 20006 edges
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 1078 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((Pback3 <= Pout3)) OR (G (F (((3 <= Pm4) OR (Pm4 <= 2)))) AND F ((Pback3 <= Pout3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Pback3 <= Pout3)) OR (G (F (((3 <= Pm4) OR (Pm4 <= 2)))) AND F ((Pback3 <= Pout3)))))
lola: processed formula length: 94
lola: 93 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: 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 1617 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((Pm1 <= Pback1) AND F (((Pm2 + 1 <= Pback2) OR F ((Pm1 <= Pm2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((Pm1 <= Pback1) AND F (((Pm2 + 1 <= Pback2) OR F ((Pm1 <= Pm2))))))))
lola: processed formula length: 79
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15030 markings, 20038 edges
lola: ========================================
lola: subprocess 15 will run for 3235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((Pback4 <= Pout4) U (G ((Pback4 <= Pout4)) AND ((3 <= P3) U (Pm2 <= Pout1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((Pback4 <= Pout4) U (G ((Pback4 <= Pout4)) AND ((3 <= P3) U (Pm2 <= Pout1)))))
lola: processed formula length: 82
lola: 93 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: 4220227 markings, 8406726 edges, 844045 markings/sec, 0 secs
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: 6382573 markings, 12725111 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((Pback3 + 1 <= Pm2) U G ((2 <= P2))) OR G ((F ((1 <= Pback4)) AND (X ((1 <= Pback4)) OR ((Pback3 <= Pback1) U (1 <= Pback4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((Pback3 + 1 <= Pm2) U G ((2 <= P2))) OR G ((F ((1 <= Pback4)) AND (X ((1 <= Pback4)) OR ((Pback3 <= Pback1) U (1 <= Pback4)))))))
lola: processed formula length: 134
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 21 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: 3901474 markings, 9574018 edges, 780295 markings/sec, 0 secs
lola: 7399275 markings, 18838726 edges, 699560 markings/sec, 5 secs
lola: 10894900 markings, 27790843 edges, 699125 markings/sec, 10 secs
lola: 14200501 markings, 36468003 edges, 661120 markings/sec, 15 secs
lola: 17414362 markings, 45104952 edges, 642772 markings/sec, 20 secs
lola: 20586561 markings, 53688473 edges, 634440 markings/sec, 25 secs
lola: 23541868 markings, 61721963 edges, 591061 markings/sec, 30 secs
lola: 26684580 markings, 70369469 edges, 628542 markings/sec, 35 secs
lola: 29553801 markings, 78527389 edges, 573844 markings/sec, 40 secs
lola: 32509197 markings, 86901944 edges, 591079 markings/sec, 45 secs
lola: 35158407 markings, 94651575 edges, 529842 markings/sec, 50 secs
lola: 37982901 markings, 102682262 edges, 564899 markings/sec, 55 secs
lola: 40504460 markings, 110005958 edges, 504312 markings/sec, 60 secs
lola: 42940602 markings, 117192207 edges, 487228 markings/sec, 65 secs
lola: 45578350 markings, 124889130 edges, 527550 markings/sec, 70 secs
lola: 48120908 markings, 132328262 edges, 508512 markings/sec, 75 secs
lola: 50411457 markings, 139471314 edges, 458110 markings/sec, 80 secs
lola: 52925110 markings, 146946158 edges, 502731 markings/sec, 85 secs
lola: 55115323 markings, 153859517 edges, 438043 markings/sec, 90 secs
lola: 57545622 markings, 160928257 edges, 486060 markings/sec, 95 secs
lola: 59853200 markings, 167971506 edges, 461516 markings/sec, 100 secs
lola: 62118586 markings, 174868965 edges, 453077 markings/sec, 105 secs
lola: 64168075 markings, 181576659 edges, 409898 markings/sec, 110 secs
lola: 66078416 markings, 187945703 edges, 382068 markings/sec, 115 secs
lola: 68384148 markings, 194891070 edges, 461146 markings/sec, 120 secs
lola: 70760543 markings, 202105311 edges, 475279 markings/sec, 125 secs
lola: 73193247 markings, 209371865 edges, 486541 markings/sec, 130 secs
lola: 75405550 markings, 216282838 edges, 442461 markings/sec, 135 secs
lola: 77669249 markings, 223349666 edges, 452740 markings/sec, 140 secs
lola: 79971371 markings, 230496210 edges, 460424 markings/sec, 145 secs
lola: 82117591 markings, 237471480 edges, 429244 markings/sec, 150 secs
lola: 84146964 markings, 244158513 edges, 405875 markings/sec, 155 secs
lola: 86103023 markings, 250864948 edges, 391212 markings/sec, 160 secs
lola: 87822289 markings, 255934396 edges, 343853 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((G ((Pback2 <= 1)) OR (X ((Pback2 <= 1)) R (Pback1 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((G ((Pback2 <= 1)) OR (X ((Pback2 <= 1)) R (Pback1 <= 2)))))))
lola: processed formula length: 74
lola: 93 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4213153 markings, 8451575 edges, 842631 markings/sec, 0 secs
lola: 8256567 markings, 16535347 edges, 808683 markings/sec, 5 secs
lola: 12049594 markings, 24122418 edges, 758605 markings/sec, 10 secs
lola: 15931798 markings, 31883838 edges, 776441 markings/sec, 15 secs
lola: 19816681 markings, 39653533 edges, 776977 markings/sec, 20 secs
lola: 23673406 markings, 47364516 edges, 771345 markings/sec, 25 secs
lola: 27506578 markings, 55030112 edges, 766634 markings/sec, 30 secs
lola: 31300651 markings, 62619443 edges, 758815 markings/sec, 35 secs
lola: 35103978 markings, 70227198 edges, 760665 markings/sec, 40 secs
lola: 38740971 markings, 77495161 edges, 727399 markings/sec, 45 secs
lola: 42435579 markings, 84885410 edges, 738922 markings/sec, 50 secs
lola: 46287770 markings, 92589006 edges, 770438 markings/sec, 55 secs
lola: 50399791 markings, 100819616 edges, 822404 markings/sec, 60 secs
lola: 53283993 markings, 106645834 edges, 576840 markings/sec, 65 secs
lola: 55779707 markings, 111636754 edges, 499143 markings/sec, 70 secs
lola: 57962169 markings, 116001368 edges, 436492 markings/sec, 75 secs
lola: 59984986 markings, 120046065 edges, 404563 markings/sec, 80 secs
lola: 62084265 markings, 124244995 edges, 419856 markings/sec, 85 secs
lola: 64063456 markings, 128201418 edges, 395838 markings/sec, 90 secs
lola: 66137291 markings, 132349264 edges, 414767 markings/sec, 95 secs
lola: 68404797 markings, 136883983 edges, 453501 markings/sec, 100 secs
lola: 70673820 markings, 141422812 edges, 453805 markings/sec, 105 secs
lola: 73167148 markings, 146405585 edges, 498666 markings/sec, 110 secs
lola: 76124110 markings, 152576041 edges, 591392 markings/sec, 115 secs
lola: 78879267 markings, 159465617 edges, 551031 markings/sec, 120 secs
lola: 81339101 markings, 165615071 edges, 491967 markings/sec, 125 secs
lola: 83415051 markings, 170803903 edges, 415190 markings/sec, 130 secs
lola: 85750449 markings, 176643701 edges, 467080 markings/sec, 135 secs
lola: 87942631 markings, 182124920 edges, 438436 markings/sec, 140 secs
lola: 90103036 markings, 187526878 edges, 432081 markings/sec, 145 secs
lola: 92207466 markings, 192790794 edges, 420886 markings/sec, 150 secs
lola: 94328545 markings, 198089334 edges, 424216 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes no unknown yes no unknown yes no yes
lola:
preliminary result: no no no no no yes no yes no unknown yes no unknown yes no yes
lola: memory consumption: 20924 KB
lola: time consumption: 678 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589724914731

--------------------
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="Kanban-PT-05000"
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 Kanban-PT-05000, 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 r105-oct2-158940199700139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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