About the Execution of ITS-LoLa for SmartHome-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15743.640 | 3600000.00 | 476304.00 | 167.20 | FTFFFFFFFTFFFFFT | normal |
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.r228-oct2-159033547100089.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 SmartHome-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100089
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.2K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 90K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-12-00
FORMULA_NAME SmartHome-PT-12-01
FORMULA_NAME SmartHome-PT-12-02
FORMULA_NAME SmartHome-PT-12-03
FORMULA_NAME SmartHome-PT-12-04
FORMULA_NAME SmartHome-PT-12-05
FORMULA_NAME SmartHome-PT-12-06
FORMULA_NAME SmartHome-PT-12-07
FORMULA_NAME SmartHome-PT-12-08
FORMULA_NAME SmartHome-PT-12-09
FORMULA_NAME SmartHome-PT-12-10
FORMULA_NAME SmartHome-PT-12-11
FORMULA_NAME SmartHome-PT-12-12
FORMULA_NAME SmartHome-PT-12-13
FORMULA_NAME SmartHome-PT-12-14
FORMULA_NAME SmartHome-PT-12-15
=== Now, execution of the tool begins
BK_START 1591290210192
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:03:32] [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-04 17:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:03:32] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-04 17:03:32] [INFO ] Transformed 376 places.
[2020-06-04 17:03:32] [INFO ] Transformed 399 transitions.
[2020-06-04 17:03:32] [INFO ] Found NUPN structural information;
[2020-06-04 17:03:32] [INFO ] Parsed PT model containing 376 places and 399 transitions in 93 ms.
Deduced a syphon composed of 104 places in 6 ms
Reduce places removed 104 places and 80 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 463 resets, run finished after 166 ms. (steps per millisecond=602 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 319 rows 272 cols
[2020-06-04 17:03:32] [INFO ] Computed 13 place invariants in 9 ms
[2020-06-04 17:03:32] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2020-06-04 17:03:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:03:32] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-04 17:03:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2020-06-04 17:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-06-04 17:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:03:33] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2020-06-04 17:03:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned unsat
[2020-06-04 17:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2020-06-04 17:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:03:33] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2020-06-04 17:03:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:03:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned unsat
[2020-06-04 17:03:33] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2020-06-04 17:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:03:34] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-06-04 17:03:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 27 ms returned unsat
[2020-06-04 17:03:34] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2020-06-04 17:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:03:34] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-06-04 17:03:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:03:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2020-06-04 17:03:34] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2020-06-04 17:03:34] [INFO ] Flatten gal took : 63 ms
FORMULA SmartHome-PT-12-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:03:34] [INFO ] Applying decomposition
[2020-06-04 17:03:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 17:03:34] [INFO ] Flatten gal took : 16 ms
[2020-06-04 17:03:34] [INFO ] Decomposing Gal with order
[2020-06-04 17:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:03:34] [INFO ] Removed a total of 17 redundant transitions.
[2020-06-04 17:03:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 17:03:34] [INFO ] Flatten gal took : 55 ms
[2020-06-04 17:03:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 13 ms.
[2020-06-04 17:03:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-12-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:03:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-04 17:03:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-12 @ 3570 seconds
FORMULA SmartHome-PT-12-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmartHome-PT-12-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3109
rslt: Output for LTLCardinality @ SmartHome-PT-12
{
"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": "Thu Jun 4 17:03:35 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((F ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0)))) AND (((p80 <= 0)) OR X ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0))))))))",
"processed_size": 137,
"rewrites": 65
},
"result":
{
"edges": 136,
"markings": 118,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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": "X (((1 <= p250)))",
"processed_size": 17,
"rewrites": 65
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "(((1 <= p103)) U X (G (((1 <= p204)))))",
"processed_size": 39,
"rewrites": 65
},
"result":
{
"edges": 19,
"markings": 19,
"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": 892
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 9,
"adisj": 3,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (F ((G ((((1 <= p241)) AND ((p70 <= 0)))) OR (X (((1 <= p108))) AND (((1 <= p241)) AND ((p70 <= 0))))))) AND (F ((((p241 <= 0)) OR ((1 <= p70)))) OR (((p241 <= 0)) OR ((1 <= p70))))))",
"processed_size": 190,
"rewrites": 65
},
"result":
{
"edges": 20,
"markings": 20,
"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": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((((p183 <= 0)) OR ((1 <= p16))) U X ((((p183 <= 0)) OR ((1 <= p16))))) AND G (F (((1 <= p91)))))))",
"processed_size": 108,
"rewrites": 65
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"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 ((((p167 <= 0)) OR ((1 <= p143)))))",
"processed_size": 41,
"rewrites": 65
},
"result":
{
"edges": 1299,
"markings": 1000,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((G ((((p66 <= 0)) OR ((1 <= p37)))) OR ((1 <= p249))))) OR ((1 <= p45)))))",
"processed_size": 88,
"rewrites": 65
},
"result":
{
"edges": 203915468,
"markings": 54522117,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 26452,
"runtime": 461.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((F((** AND **)) AND (** OR X((** AND **)))))) : G(F(**)) : G(F((F(G((G(**) OR **))) OR *))) : X(**) : (** U X(G(*))) : X((X(F((G(*) OR (X(*) AND *)))) AND (F(**) OR (** OR **)))) : G(F(((** U X(**)) AND G(F(*)))))"
},
"net":
{
"arcs": 715,
"conflict_clusters": 252,
"places": 272,
"places_significant": 259,
"singleton_clusters": 0,
"transitions": 319
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "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: 591/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8704
lola: finding significant places
lola: 272 places, 319 transitions, 259 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 true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: G (X ((((p80 <= 0)) U (X (((1 <= p27) OR ((p80 <= 0)))) AND X (((p80 <= 0))))))) : X (G (F (X ((((p167 <= 0)) OR ((1 <= p143))))))) : X (NOT(F (G (X ((NOT(F (G ((G ((((p66 <= 0)) OR ((1 <= p37)))) OR ((1 <= p249)))))) AND ((p45 <= 0)))))))) : X (((1 <= p250))) : (((1 <= p103)) U NOT(X (F (((p204 <= 0)))))) : X ((NOT(G (X ((X (((p108 <= 0))) U (((p241 <= 0)) OR ((1 <= p70))))))) AND ((F ((((p241 <= 0)) OR ((1 <= p70)))) OR ((p241 <= 0))) OR ((1 <= p70))))) : G (X (F (NOT(X ((NOT(((((p183 <= 0)) OR ((1 <= p16))) U X ((((p183 <= 0)) OR ((1 <= p16)))))) OR F (G (((p91 <= 0))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:353
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:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0)))) AND (((p80 <= 0)) OR X ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0)))) AND (((p80 <= 0)) OR X ((((1 <= p27) OR ((p80 <= 0))) AND ((p80 <= 0))))))))
lola: processed formula length: 137
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 118 markings, 136 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p250)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p250)))
lola: processed formula length: 17
lola: 65 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p103)) U X (G (((1 <= p204)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p103)) U X (G (((1 <= p204)))))
lola: processed formula length: 39
lola: 65 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((G ((((1 <= p241)) AND ((p70 <= 0)))) OR (X (((1 <= p108))) AND (((1 <= p241)) AND ((p70 <= 0))))))) AND (F ((((p241 <= 0)) OR ((1 <= p70)))) OR (((p241 <= 0)) OR ((1 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((G ((((1 <= p241)) AND ((p70 <= 0)))) OR (X (((1 <= p108))) AND (((1 <= p241)) AND ((p70 <= 0))))))) AND (F ((((p241 <= 0)) OR ((1 <= p70)))) OR (((p241 <= 0)) OR ((1 <= p70))))))
lola: processed formula length: 190
lola: 65 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((((p183 <= 0)) OR ((1 <= p16))) U X ((((p183 <= 0)) OR ((1 <= p16))))) AND G (F (((1 <= p91)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((((p183 <= 0)) OR ((1 <= p16))) U X ((((p183 <= 0)) OR ((1 <= p16))))) AND G (F (((1 <= p91)))))))
lola: processed formula length: 108
lola: 65 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p167 <= 0)) OR ((1 <= p143)))))
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 ((((p167 <= 0)) OR ((1 <= p143)))))
lola: processed formula length: 41
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1000 markings, 1299 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((G ((((p66 <= 0)) OR ((1 <= p37)))) OR ((1 <= p249))))) OR ((1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((G ((((p66 <= 0)) OR ((1 <= p37)))) OR ((1 <= p249))))) OR ((1 <= p45)))))
lola: processed formula length: 88
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 883307 markings, 2676606 edges, 176661 markings/sec, 0 secs
lola: 1646399 markings, 5252176 edges, 152618 markings/sec, 5 secs
lola: 2476763 markings, 7932348 edges, 166073 markings/sec, 10 secs
lola: 3254166 markings, 10589625 edges, 155481 markings/sec, 15 secs
lola: 4067479 markings, 13153923 edges, 162663 markings/sec, 20 secs
lola: 4910029 markings, 15714012 edges, 168510 markings/sec, 25 secs
lola: 5660155 markings, 18125412 edges, 150025 markings/sec, 30 secs
lola: 6405725 markings, 20685622 edges, 149114 markings/sec, 35 secs
lola: 7202215 markings, 23080161 edges, 159298 markings/sec, 40 secs
lola: 8025961 markings, 25348102 edges, 164749 markings/sec, 45 secs
lola: 8855386 markings, 27615713 edges, 165885 markings/sec, 50 secs
lola: 9633684 markings, 29960395 edges, 155660 markings/sec, 55 secs
lola: 10391719 markings, 32316790 edges, 151607 markings/sec, 60 secs
lola: 11146427 markings, 34621827 edges, 150942 markings/sec, 65 secs
lola: 11890923 markings, 36894257 edges, 148899 markings/sec, 70 secs
lola: 12642810 markings, 39242219 edges, 150377 markings/sec, 75 secs
lola: 13358737 markings, 41584829 edges, 143185 markings/sec, 80 secs
lola: 14031877 markings, 43832404 edges, 134628 markings/sec, 85 secs
lola: 14562334 markings, 46004220 edges, 106091 markings/sec, 90 secs
lola: 15225369 markings, 48179453 edges, 132607 markings/sec, 95 secs
lola: 15964899 markings, 50406195 edges, 147906 markings/sec, 100 secs
lola: 16682380 markings, 52666444 edges, 143496 markings/sec, 105 secs
lola: 17386007 markings, 54946603 edges, 140725 markings/sec, 110 secs
lola: 18079042 markings, 57321243 edges, 138607 markings/sec, 115 secs
lola: 18766131 markings, 59666202 edges, 137418 markings/sec, 120 secs
lola: 19445045 markings, 61984688 edges, 135783 markings/sec, 125 secs
lola: 20123625 markings, 64179468 edges, 135716 markings/sec, 130 secs
lola: 20796882 markings, 66393472 edges, 134651 markings/sec, 135 secs
lola: 21454817 markings, 68529505 edges, 131587 markings/sec, 140 secs
lola: 22119526 markings, 70700207 edges, 132942 markings/sec, 145 secs
lola: 22761582 markings, 72888090 edges, 128411 markings/sec, 150 secs
lola: 23401300 markings, 75156881 edges, 127944 markings/sec, 155 secs
lola: 24054582 markings, 77511332 edges, 130656 markings/sec, 160 secs
lola: 24693361 markings, 79871714 edges, 127756 markings/sec, 165 secs
lola: 25285206 markings, 82140472 edges, 118369 markings/sec, 170 secs
lola: 25895350 markings, 84511185 edges, 122029 markings/sec, 175 secs
lola: 26441137 markings, 86731776 edges, 109157 markings/sec, 180 secs
lola: 26953371 markings, 88952715 edges, 102447 markings/sec, 185 secs
lola: 27419655 markings, 91090546 edges, 93257 markings/sec, 190 secs
lola: 27858357 markings, 93143068 edges, 87740 markings/sec, 195 secs
lola: 28489887 markings, 95377197 edges, 126306 markings/sec, 200 secs
lola: 29104902 markings, 97653245 edges, 123003 markings/sec, 205 secs
lola: 29715495 markings, 99833284 edges, 122119 markings/sec, 210 secs
lola: 30305164 markings, 101943527 edges, 117934 markings/sec, 215 secs
lola: 30881495 markings, 104078977 edges, 115266 markings/sec, 220 secs
lola: 31449039 markings, 106189755 edges, 113509 markings/sec, 225 secs
lola: 32016700 markings, 108327441 edges, 113532 markings/sec, 230 secs
lola: 32567361 markings, 110517340 edges, 110132 markings/sec, 235 secs
lola: 33127287 markings, 112695108 edges, 111985 markings/sec, 240 secs
lola: 33699670 markings, 114999866 edges, 114477 markings/sec, 245 secs
lola: 34261019 markings, 117205437 edges, 112270 markings/sec, 250 secs
lola: 34820333 markings, 119483676 edges, 111863 markings/sec, 255 secs
lola: 35396790 markings, 121872057 edges, 115291 markings/sec, 260 secs
lola: 35973820 markings, 124213721 edges, 115406 markings/sec, 265 secs
lola: 36562793 markings, 126612356 edges, 117795 markings/sec, 270 secs
lola: 37151244 markings, 129030327 edges, 117690 markings/sec, 275 secs
lola: 37726751 markings, 131406959 edges, 115101 markings/sec, 280 secs
lola: 38249308 markings, 133698457 edges, 104511 markings/sec, 285 secs
lola: 38630636 markings, 135756954 edges, 76266 markings/sec, 290 secs
lola: 39129416 markings, 137742612 edges, 99756 markings/sec, 295 secs
lola: 39648386 markings, 139666893 edges, 103794 markings/sec, 300 secs
lola: 40167911 markings, 141790571 edges, 103905 markings/sec, 305 secs
lola: 40672942 markings, 143894961 edges, 101006 markings/sec, 310 secs
lola: 41145942 markings, 145869371 edges, 94600 markings/sec, 315 secs
lola: 41582001 markings, 147747251 edges, 87212 markings/sec, 320 secs
lola: 42115578 markings, 149769503 edges, 106715 markings/sec, 325 secs
lola: 42790343 markings, 152014416 edges, 134953 markings/sec, 330 secs
lola: 43484268 markings, 153946208 edges, 138785 markings/sec, 335 secs
lola: 44149387 markings, 155751760 edges, 133024 markings/sec, 340 secs
lola: 44761465 markings, 157513529 edges, 122416 markings/sec, 345 secs
lola: 45352374 markings, 159402172 edges, 118182 markings/sec, 350 secs
lola: 45927556 markings, 161482990 edges, 115036 markings/sec, 355 secs
lola: 46488182 markings, 163576794 edges, 112125 markings/sec, 360 secs
lola: 46992442 markings, 165711591 edges, 100852 markings/sec, 365 secs
lola: 47511245 markings, 167982666 edges, 103761 markings/sec, 370 secs
lola: 48019505 markings, 170159865 edges, 101652 markings/sec, 375 secs
lola: 48557665 markings, 172467653 edges, 107632 markings/sec, 380 secs
lola: 49097148 markings, 174810897 edges, 107897 markings/sec, 385 secs
lola: 49591575 markings, 177092482 edges, 98885 markings/sec, 390 secs
lola: 50121243 markings, 179389903 edges, 105934 markings/sec, 395 secs
lola: 50677478 markings, 181597708 edges, 111247 markings/sec, 400 secs
lola: 51165545 markings, 183776887 edges, 97613 markings/sec, 405 secs
lola: 51625178 markings, 186022430 edges, 91927 markings/sec, 410 secs
lola: 51979116 markings, 188217457 edges, 70788 markings/sec, 415 secs
lola: 52244909 markings, 190283570 edges, 53159 markings/sec, 420 secs
lola: 52453526 markings, 192191443 edges, 41723 markings/sec, 425 secs
lola: 52783064 markings, 194140678 edges, 65908 markings/sec, 430 secs
lola: 52989231 markings, 195994701 edges, 41233 markings/sec, 435 secs
lola: 53239548 markings, 197956824 edges, 50063 markings/sec, 440 secs
lola: 53597481 markings, 199988111 edges, 71587 markings/sec, 445 secs
lola: 54115254 markings, 202192155 edges, 103555 markings/sec, 450 secs
lola: add low 243
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: 54522117 markings, 203915468 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 26452 KB
lola: time consumption: 461 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="SmartHome-PT-12"
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 SmartHome-PT-12, 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 r228-oct2-159033547100089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-12.tgz
mv SmartHome-PT-12 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 '
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 ;