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.r184-oct2-158987928300257.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 itslola
Input is HypercubeGrid-PT-C4K3P3B12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928300257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 5.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 3.0M Apr 27 15:14 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 HypercubeGrid-PT-C4K3P3B12-00
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-01
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-02
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-03
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-04
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-05
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-06
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-07
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-08
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-09
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-10
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-11
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-12
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-13
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-14
FORMULA_NAME HypercubeGrid-PT-C4K3P3B12-15

=== Now, execution of the tool begins

BK_START 1591199834600

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:57:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 15:57:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:57:16] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2020-06-03 15:57:16] [INFO ] Transformed 2457 places.
[2020-06-03 15:57:16] [INFO ] Transformed 5400 transitions.
[2020-06-03 15:57:16] [INFO ] Parsed PT model containing 2457 places and 5400 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 9886 ms. (steps per millisecond=10 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 5400 rows 2457 cols
[2020-06-03 15:57:26] [INFO ] Computed 946 place invariants in 230 ms
[2020-06-03 15:57:27] [INFO ] [Real]Absence check using 945 positive place invariants in 179 ms returned unsat
[2020-06-03 15:57:28] [INFO ] [Real]Absence check using 945 positive place invariants in 751 ms returned unsat
[2020-06-03 15:57:28] [INFO ] [Real]Absence check using 945 positive place invariants in 435 ms returned unsat
[2020-06-03 15:57:29] [INFO ] [Real]Absence check using 945 positive place invariants in 192 ms returned unsat
[2020-06-03 15:57:29] [INFO ] [Real]Absence check using 945 positive place invariants in 12 ms returned unsat
[2020-06-03 15:57:29] [INFO ] [Real]Absence check using 945 positive place invariants in 120 ms returned unsat
[2020-06-03 15:57:30] [INFO ] [Real]Absence check using 945 positive place invariants in 343 ms returned unsat
[2020-06-03 15:57:30] [INFO ] [Real]Absence check using 945 positive place invariants in 12 ms returned unsat
[2020-06-03 15:57:30] [INFO ] [Real]Absence check using 945 positive place invariants in 220 ms returned unsat
[2020-06-03 15:57:31] [INFO ] [Real]Absence check using 945 positive place invariants in 919 ms returned sat
[2020-06-03 15:57:31] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 46 ms returned sat
[2020-06-03 15:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:57:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:57:50] [INFO ] [Real]Absence check using state equation in 18913 ms returned (error "Failed to check-sat")
[2020-06-03 15:57:51] [INFO ] [Real]Absence check using 945 positive place invariants in 869 ms returned unsat
[2020-06-03 15:57:52] [INFO ] [Real]Absence check using 945 positive place invariants in 867 ms returned sat
[2020-06-03 15:57:52] [INFO ] [Real]Absence check using 945 positive and 1 generalized place invariants in 48 ms returned sat
[2020-06-03 15:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:58:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 15:58:11] [INFO ] [Real]Absence check using state equation in 18982 ms returned (error "Failed to check-sat")
[2020-06-03 15:58:11] [INFO ] [Real]Absence check using 945 positive place invariants in 20 ms returned unsat
[2020-06-03 15:58:12] [INFO ] [Real]Absence check using 945 positive place invariants in 378 ms returned unsat
[2020-06-03 15:58:12] [INFO ] [Real]Absence check using 945 positive place invariants in 363 ms returned unsat
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
[2020-06-03 15:58:13] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-03 15:58:13] [INFO ] Flatten gal took : 400 ms
FORMULA HypercubeGrid-PT-C4K3P3B12-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C4K3P3B12-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:58:13] [INFO ] Flatten gal took : 263 ms
[2020-06-03 15:58:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 16 ms.
[2020-06-03 15:58:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3570 seconds

FORMULA HypercubeGrid-PT-C4K3P3B12-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypercubeGrid-PT-C4K3P3B12-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3131
rslt: Output for LTLCardinality @ HypercubeGrid-PT-C4K3P3B12

{
"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": "mcc2020",
"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": "Wed Jun 3 15:58:14 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p1966 + 1 <= p249))))",
"processed_size": 31,
"rewrites": 43
},
"result":
{
"edges": 8835,
"markings": 8835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 443
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((X ((p244 <= p1634)) U ((p1634 + 1 <= p244) AND (p1964 <= p2059))) U (F (G ((3 <= p197))) AND G (((p1964 <= p2059) OR X (G ((3 <= p197)))))))",
"processed_size": 142,
"rewrites": 43
},
"result":
{
"edges": 10943,
"markings": 10943,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 51
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "X (((p1818 <= p1891) AND X (F ((p1460 <= p1424)))))",
"processed_size": 51,
"rewrites": 43
},
"result":
{
"edges": 10513,
"markings": 10513,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "X (((1 <= p1658) AND X ((X (((1 <= p1658) AND (p636 <= p290))) OR G (((p873 <= p36)))))))",
"processed_size": 89,
"rewrites": 43
},
"result":
{
"edges": 8835,
"markings": 8835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p1008 + 1 <= p1577) U X (F ((1 <= p1940))))",
"processed_size": 45,
"rewrites": 43
},
"result":
{
"edges": 8835,
"markings": 8835,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p525)))",
"processed_size": 19,
"rewrites": 43
},
"result":
{
"edges": 50114,
"markings": 45592,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1117
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "G (F ((p1918 + 1 <= p1782)))",
"processed_size": 28,
"rewrites": 43
},
"result":
{
"edges": 9258,
"markings": 9258,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1635
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (((p90 <= 1))) OR (p126 + 1 <= p719))))",
"processed_size": 48,
"rewrites": 43
},
"result":
{
"edges": 7045,
"markings": 7045,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 3241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((((p901 + 1 <= p1765) R (p889 + 1 <= p1765)) OR (2 <= p278))))",
"processed_size": 68,
"rewrites": 43
},
"result":
{
"edges": 51978,
"markings": 47173,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 174704,
"runtime": 439.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(*))) : G(F((F(*) OR *))) : G(F(((* R *) OR **))) : ((X(**) U **) U (F(G(**)) AND G((** OR X(G(**)))))) : X((** AND X(F(**)))) : X((** AND X((X(**) OR G(**))))) : F(G(**)) : G(F(*)) : (** U X(F(**)))"
},
"net":
{
"arcs": 21600,
"conflict_clusters": 945,
"places": 2457,
"places_significant": 1511,
"singleton_clusters": 0,
"transitions": 5400
},
"result":
{
"preliminary_value": "no no no no no no no no no ",
"value": "no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 7857/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 78624
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 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 <= p1173)
lola: LP says that atomic proposition is always false: (3 <= p2134)
lola: X (NOT(F (F (X ((p249 <= p1966)))))) : G (F (NOT(G ((X (G (((2 <= p90)))) AND X ((p719 <= p126))))))) : F (G (F (X (F ((X ((p1765 <= p889)) U (NOT(((p1765 <= p901) U (p1765 <= p889))) OR (2 <= p278)))))))) : ((X ((p244 <= p1634)) U ((p1634 + 1 <= p244) AND (p1964 <= p2059))) U G (((p1964 <= p2059) U X (G ((3 <= p197)))))) : X ((((1 <= 0) U (p1818 <= p1891)) AND F (X ((p1460 <= p1424))))) : X (((1 <= p1658) AND (X (X (((1 <= p1658) AND (p636 <= p290)))) OR X (G (((p873 <= p36))))))) : G ((((p195 <= p2070) OR ((p566 <= p569))) U F (G ((2 <= p525))))) : X (F (NOT(G (F (G ((p1782 <= p1918))))))) : ((p1008 + 1 <= p1577) U X (F ((1 <= p1940))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p1966 + 1 <= p249))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p1966 + 1 <= p249))))
lola: processed formula length: 31
lola: 43 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: 8835 markings, 8835 edges
lola: ========================================
lola: subprocess 1 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((p244 <= p1634)) U ((p1634 + 1 <= p244) AND (p1964 <= p2059))) U (F (G ((3 <= p197))) AND G (((p1964 <= p2059) OR X (G ((3 <= p197)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((p244 <= p1634)) U ((p1634 + 1 <= p244) AND (p1964 <= p2059))) U (F (G ((3 <= p197))) AND G (((p1964 <= p2059) OR X (G ((3 <= p197)))))))
lola: processed formula length: 142
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 51 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: 10943 markings, 10943 edges
lola: ========================================
lola: subprocess 2 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p1818 <= p1891) AND X (F ((p1460 <= p1424)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p1818 <= p1891) AND X (F ((p1460 <= p1424)))))
lola: processed formula length: 51
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 10513 markings, 10513 edges
lola: ========================================
lola: subprocess 3 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p1658) AND X ((X (((1 <= p1658) AND (p636 <= p290))) OR G (((p873 <= p36)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p1658) AND X ((X (((1 <= p1658) AND (p636 <= p290))) OR G (((p873 <= p36)))))))
lola: processed formula length: 89
lola: 43 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: 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: 8835 markings, 8835 edges
lola: ========================================
lola: subprocess 4 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1008 + 1 <= p1577) U X (F ((1 <= p1940))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p1008 + 1 <= p1577) U X (F ((1 <= p1940))))
lola: processed formula length: 45
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8835 markings, 8835 edges
lola: ========================================
lola: subprocess 5 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p525)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((2 <= p525)))
lola: processed formula length: 19
lola: 43 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: 2958 markings, 2957 edges, 592 markings/sec, 0 secs
lola: 2997 markings, 2996 edges, 8 markings/sec, 5 secs
lola: 3182 markings, 3181 edges, 37 markings/sec, 10 secs
lola: 3236 markings, 3235 edges, 11 markings/sec, 15 secs
lola: 3295 markings, 3294 edges, 12 markings/sec, 20 secs
lola: 3389 markings, 3388 edges, 19 markings/sec, 25 secs
lola: 3558 markings, 3557 edges, 34 markings/sec, 30 secs
lola: 3827 markings, 3826 edges, 54 markings/sec, 35 secs
lola: 3913 markings, 3912 edges, 17 markings/sec, 40 secs
lola: 4014 markings, 4013 edges, 20 markings/sec, 45 secs
lola: 4081 markings, 4080 edges, 13 markings/sec, 50 secs
lola: 4164 markings, 4163 edges, 17 markings/sec, 55 secs
lola: 4251 markings, 4250 edges, 17 markings/sec, 60 secs
lola: 4329 markings, 4328 edges, 16 markings/sec, 65 secs
lola: 4406 markings, 4405 edges, 15 markings/sec, 70 secs
lola: 4537 markings, 4536 edges, 26 markings/sec, 75 secs
lola: 4679 markings, 4678 edges, 28 markings/sec, 80 secs
lola: 4838 markings, 4837 edges, 32 markings/sec, 85 secs
lola: 5041 markings, 5040 edges, 41 markings/sec, 90 secs
lola: 5263 markings, 5262 edges, 44 markings/sec, 95 secs
lola: 5436 markings, 5435 edges, 35 markings/sec, 100 secs
lola: 5642 markings, 5641 edges, 41 markings/sec, 105 secs
lola: 5831 markings, 5830 edges, 38 markings/sec, 110 secs
lola: 6003 markings, 6002 edges, 34 markings/sec, 115 secs
lola: 6150 markings, 6149 edges, 29 markings/sec, 120 secs
lola: 6426 markings, 6425 edges, 55 markings/sec, 125 secs
lola: 6757 markings, 6756 edges, 66 markings/sec, 130 secs
lola: 7060 markings, 7059 edges, 61 markings/sec, 135 secs
lola: 7360 markings, 7359 edges, 60 markings/sec, 140 secs
lola: 7723 markings, 7722 edges, 73 markings/sec, 145 secs
lola: 8125 markings, 8132 edges, 80 markings/sec, 150 secs
lola: 8665 markings, 8720 edges, 108 markings/sec, 155 secs
lola: 9246 markings, 9359 edges, 116 markings/sec, 160 secs
lola: 9868 markings, 10014 edges, 124 markings/sec, 165 secs
lola: 11421 markings, 11608 edges, 311 markings/sec, 170 secs
lola: 16795 markings, 17706 edges, 1075 markings/sec, 175 secs
lola: 27224 markings, 29496 edges, 2086 markings/sec, 180 secs
lola: 38799 markings, 42484 edges, 2315 markings/sec, 185 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: 45592 markings, 50114 edges
lola: ========================================
lola: subprocess 6 will run for 1117 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p1918 + 1 <= p1782)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p1918 + 1 <= p1782)))
lola: processed formula length: 28
lola: 43 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: 2369 markings, 2368 edges, 474 markings/sec, 0 secs
lola: 2425 markings, 2424 edges, 11 markings/sec, 5 secs
lola: 4429 markings, 4428 edges, 401 markings/sec, 10 secs
lola: 4757 markings, 4756 edges, 66 markings/sec, 15 secs
lola: 4858 markings, 4857 edges, 20 markings/sec, 20 secs
lola: 4965 markings, 4964 edges, 21 markings/sec, 25 secs
lola: 5263 markings, 5262 edges, 60 markings/sec, 30 secs
lola: 5467 markings, 5466 edges, 41 markings/sec, 35 secs
lola: 5958 markings, 5957 edges, 98 markings/sec, 40 secs
lola: 6085 markings, 6084 edges, 25 markings/sec, 45 secs
lola: 6256 markings, 6255 edges, 34 markings/sec, 50 secs
lola: 6558 markings, 6557 edges, 60 markings/sec, 55 secs
lola: 6922 markings, 6921 edges, 73 markings/sec, 60 secs
lola: 7476 markings, 7475 edges, 111 markings/sec, 65 secs
lola: 8327 markings, 8326 edges, 170 markings/sec, 70 secs
lola: 8983 markings, 8982 edges, 131 markings/sec, 75 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: 9258 markings, 9258 edges
lola: ========================================
lola: subprocess 7 will run for 1635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p90 <= 1))) OR (p126 + 1 <= p719))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p90 <= 1))) OR (p126 + 1 <= p719))))
lola: processed formula length: 48
lola: 43 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: 2748 markings, 2747 edges, 550 markings/sec, 0 secs
lola: 3537 markings, 3536 edges, 158 markings/sec, 5 secs
lola: 4099 markings, 4098 edges, 112 markings/sec, 10 secs
lola: 4759 markings, 4758 edges, 132 markings/sec, 15 secs
lola: 5463 markings, 5462 edges, 141 markings/sec, 20 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: 7045 markings, 7045 edges
lola: ========================================
lola: subprocess 8 will run for 3241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p901 + 1 <= p1765) R (p889 + 1 <= p1765)) OR (2 <= p278))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p901 + 1 <= p1765) R (p889 + 1 <= p1765)) OR (2 <= p278))))
lola: processed formula length: 68
lola: 43 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: 2581 markings, 2580 edges, 516 markings/sec, 0 secs
lola: 2620 markings, 2619 edges, 8 markings/sec, 5 secs
lola: 2669 markings, 2668 edges, 10 markings/sec, 10 secs
lola: 2810 markings, 2809 edges, 28 markings/sec, 15 secs
lola: 3161 markings, 3160 edges, 70 markings/sec, 20 secs
lola: 3384 markings, 3383 edges, 45 markings/sec, 25 secs
lola: 3486 markings, 3485 edges, 20 markings/sec, 30 secs
lola: 3570 markings, 3569 edges, 17 markings/sec, 35 secs
lola: 3649 markings, 3648 edges, 16 markings/sec, 40 secs
lola: 3737 markings, 3736 edges, 18 markings/sec, 45 secs
lola: 3831 markings, 3830 edges, 19 markings/sec, 50 secs
lola: 3931 markings, 3930 edges, 20 markings/sec, 55 secs
lola: 4050 markings, 4049 edges, 24 markings/sec, 60 secs
lola: 4178 markings, 4177 edges, 26 markings/sec, 65 secs
lola: 4376 markings, 4375 edges, 40 markings/sec, 70 secs
lola: 4654 markings, 4653 edges, 56 markings/sec, 75 secs
lola: 4977 markings, 4976 edges, 65 markings/sec, 80 secs
lola: 5334 markings, 5333 edges, 71 markings/sec, 85 secs
lola: 5688 markings, 5687 edges, 71 markings/sec, 90 secs
lola: 6104 markings, 6103 edges, 83 markings/sec, 95 secs
lola: 7227 markings, 7226 edges, 225 markings/sec, 100 secs
lola: 43824 markings, 48203 edges, 7319 markings/sec, 105 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: 47173 markings, 51978 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no no
lola:
preliminary result: no no no no no no no no no
lola: ========================================
lola: memory consumption: 174704 KB
lola: time consumption: 439 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
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="HypercubeGrid-PT-C4K3P3B12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
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 itslola"
echo " Input is HypercubeGrid-PT-C4K3P3B12, 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 r184-oct2-158987928300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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