fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033476900073
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPs-PT-003A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15747.710 3600000.00 494791.00 2269.50 FFFTFFFFTTTTTFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.7K May 14 00:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 00:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.6K May 13 13:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 26K 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 ShieldIIPs-PT-003A-00
FORMULA_NAME ShieldIIPs-PT-003A-01
FORMULA_NAME ShieldIIPs-PT-003A-02
FORMULA_NAME ShieldIIPs-PT-003A-03
FORMULA_NAME ShieldIIPs-PT-003A-04
FORMULA_NAME ShieldIIPs-PT-003A-05
FORMULA_NAME ShieldIIPs-PT-003A-06
FORMULA_NAME ShieldIIPs-PT-003A-07
FORMULA_NAME ShieldIIPs-PT-003A-08
FORMULA_NAME ShieldIIPs-PT-003A-09
FORMULA_NAME ShieldIIPs-PT-003A-10
FORMULA_NAME ShieldIIPs-PT-003A-11
FORMULA_NAME ShieldIIPs-PT-003A-12
FORMULA_NAME ShieldIIPs-PT-003A-13
FORMULA_NAME ShieldIIPs-PT-003A-14
FORMULA_NAME ShieldIIPs-PT-003A-15

=== Now, execution of the tool begins

BK_START 1591284241368

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:24:02] [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 15:24:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:24:03] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2020-06-04 15:24:03] [INFO ] Transformed 78 places.
[2020-06-04 15:24:03] [INFO ] Transformed 75 transitions.
[2020-06-04 15:24:03] [INFO ] Found NUPN structural information;
[2020-06-04 15:24:03] [INFO ] Parsed PT model containing 78 places and 75 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 528 resets, run finished after 218 ms. (steps per millisecond=458 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 75 rows 78 cols
[2020-06-04 15:24:03] [INFO ] Computed 28 place invariants in 5 ms
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using 28 positive place invariants in 22 ms returned sat
[2020-06-04 15:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2020-06-04 15:24:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:24:03] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned unsat
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2020-06-04 15:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 15:24:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:24:03] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned unsat
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2020-06-04 15:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:24:03] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-04 15:24:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:24:03] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 15:24:03] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 15:24:03] [INFO ] Flatten gal took : 36 ms
FORMULA ShieldIIPs-PT-003A-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-003A-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:24:03] [INFO ] Applying decomposition
[2020-06-04 15:24:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:24:03] [INFO ] Flatten gal took : 10 ms
[2020-06-04 15:24:03] [INFO ] Decomposing Gal with order
[2020-06-04 15:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 15:24:03] [INFO ] Removed a total of 51 redundant transitions.
[2020-06-04 15:24:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 15:24:03] [INFO ] Flatten gal took : 35 ms
[2020-06-04 15:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2020-06-04 15:24:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPs-PT-003A-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:24:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-04 15:24:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPs-PT-003A @ 3570 seconds

FORMULA ShieldIIPs-PT-003A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-003A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3086
rslt: Output for LTLCardinality @ ShieldIIPs-PT-003A

{
"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 15:24:04 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((1 <= p50)) AND ((p49 <= 0)))",
"processed_size": 31,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((((p20 <= 0)) OR ((1 <= p36))))",
"processed_size": 35,
"rewrites": 21
},
"result":
{
"edges": 199,
"markings": 199,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((F (G (((p48 <= 0)))) AND G ((((p49 <= 0)) OR ((1 <= p70)))))))",
"processed_size": 70,
"rewrites": 21
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 891
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p33 <= 0))",
"processed_size": 12,
"rewrites": 23
},
"result":
{
"edges": 83678922,
"markings": 48734892,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"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": "X (X (G (((1 <= p33)))))",
"processed_size": 24,
"rewrites": 21
},
"result":
{
"edges": 254,
"markings": 254,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((((p42 <= 0)) OR ((1 <= p24)))))",
"processed_size": 39,
"rewrites": 21
},
"result":
{
"edges": 5612637,
"markings": 2087691,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1727
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((((1 <= p47)) AND ((p31 <= 0))) OR (((1 <= p2)) AND ((p52 <= 0))) OR (((1 <= p53)) AND ((p70 <= 0))))))",
"processed_size": 112,
"rewrites": 21
},
"result":
{
"edges": 368,
"markings": 367,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 0,
"aconj": 11,
"adisj": 5,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((F ((((p39 <= 0)) OR ((1 <= p3)))) U (((p59 <= 0)) OR ((1 <= p62)))) OR ((((p39 <= 0)) OR ((1 <= p3))) AND (((p59 <= 0)) OR ((1 <= p62))))) U G ((((p39 <= 0)) OR ((1 <= p3)))))",
"processed_size": 183,
"rewrites": 21
},
"result":
{
"edges": 367387722,
"markings": 97956235,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"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": 28204,
"runtime": 484.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(F(**)) AND (G(**) OR **)) : X(G((F(G(*)) AND G(**)))) : (((F(**) U **) OR **) U G(**)) : F(G(*)) : (X(X(G(**))) AND (F(**) OR G(**))) : X(F(**))"
},
"net":
{
"arcs": 330,
"conflict_clusters": 24,
"places": 78,
"places_significant": 50,
"singleton_clusters": 0,
"transitions": 75
},
"result":
{
"preliminary_value": "no no no no no yes ",
"value": "no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 153/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2496
lola: finding significant places
lola: 78 places, 75 transitions, 50 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: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: (X (F ((((p48 <= 0)) OR ((1 <= p3))))) AND (G ((((p20 <= 0)) OR ((1 <= p36)))) OR (((1 <= p50)) AND ((p49 <= 0))))) : X (G ((NOT(G (X (G (F (((1 <= p48))))))) AND G ((((p49 <= 0)) OR ((1 <= p70))))))) : (((F ((((p39 <= 0)) OR ((1 <= p3)))) U (((p59 <= 0)) OR ((1 <= p62)))) OR ((((p39 <= 0)) OR ((1 <= p3))) AND (((p59 <= 0)) OR ((1 <= p62))))) U G ((((p39 <= 0)) OR ((1 <= p3))))) : X (G (F (NOT(X (G (F (((((p47 <= 0)) OR ((1 <= p31))) AND (((p2 <= 0)) OR ((1 <= p52))) AND (((p53 <= 0)) OR ((1 <= p70))))))))))) : (NOT(X (NOT(X (G (((1 <= p33))))))) AND (((1 <= 0) U F (((1 <= p33)))) OR G ((((p18 <= 0)) OR ((1 <= p62)))))) : X (F ((((p42 <= 0)) OR ((1 <= p24)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p48 <= 0)) OR ((1 <= p3))))) AND (G ((((p20 <= 0)) OR ((1 <= p36)))) OR (((1 <= p50)) AND ((p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p50)) AND ((p49 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p50)) AND ((p49 <= 0)))
lola: processed formula length: 31
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p20 <= 0)) OR ((1 <= p36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p20 <= 0)) OR ((1 <= p36))))
lola: processed formula length: 35
lola: 21 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: 199 markings, 199 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((p48 <= 0)))) AND G ((((p49 <= 0)) OR ((1 <= p70)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((p48 <= 0)))) AND G ((((p49 <= 0)) OR ((1 <= p70)))))))
lola: processed formula length: 70
lola: 21 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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G (((1 <= p33))))) AND (F (((1 <= p33))) OR G ((((p18 <= 0)) OR ((1 <= p62))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p33 <= 0))
lola: processed formula length: 12
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 2603740 markings, 4501461 edges, 520748 markings/sec, 0 secs
lola: 4952255 markings, 8497065 edges, 469703 markings/sec, 5 secs
lola: 7406299 markings, 12765758 edges, 490809 markings/sec, 10 secs
lola: 9870540 markings, 16974485 edges, 492848 markings/sec, 15 secs
lola: 12388599 markings, 21218190 edges, 503612 markings/sec, 20 secs
lola: 14621925 markings, 25188004 edges, 446665 markings/sec, 25 secs
lola: 16771790 markings, 29029687 edges, 429973 markings/sec, 30 secs
lola: 19104226 markings, 32947541 edges, 466487 markings/sec, 35 secs
lola: 21548644 markings, 37099722 edges, 488884 markings/sec, 40 secs
lola: 23810210 markings, 40963726 edges, 452313 markings/sec, 45 secs
lola: 25884739 markings, 44707975 edges, 414906 markings/sec, 50 secs
lola: 28158684 markings, 48532245 edges, 454789 markings/sec, 55 secs
lola: 30320879 markings, 52282657 edges, 432439 markings/sec, 60 secs
lola: 32461332 markings, 55862751 edges, 428091 markings/sec, 65 secs
lola: 34498692 markings, 59380418 edges, 407472 markings/sec, 70 secs
lola: 36539654 markings, 63027236 edges, 408192 markings/sec, 75 secs
lola: 38837934 markings, 67005012 edges, 459656 markings/sec, 80 secs
lola: 41105258 markings, 70814226 edges, 453465 markings/sec, 85 secs
lola: 43183326 markings, 74348275 edges, 415614 markings/sec, 90 secs
lola: 45491089 markings, 78204829 edges, 461553 markings/sec, 95 secs
lola: 47907352 markings, 82281431 edges, 483253 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 48734892 markings, 83678922 edges
lola: ========================================
lola: subprocess 3 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p33)))))
lola: processed formula length: 24
lola: 21 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: 254 markings, 254 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p42 <= 0)) OR ((1 <= p24)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p42 <= 0)) OR ((1 <= p24)))))
lola: processed formula length: 39
lola: 21 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: 2087691 markings, 5612637 edges
lola: ========================================
lola: subprocess 4 will run for 1727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((((1 <= p47)) AND ((p31 <= 0))) OR (((1 <= p2)) AND ((p52 <= 0))) OR (((1 <= p53)) AND ((p70 <= 0))))))
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 (((((1 <= p47)) AND ((p31 <= 0))) OR (((1 <= p2)) AND ((p52 <= 0))) OR (((1 <= p53)) AND ((p70 <= 0))))))
lola: processed formula length: 112
lola: 21 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: 367 markings, 368 edges
lola: ========================================
lola: subprocess 5 will run for 3455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F ((((p39 <= 0)) OR ((1 <= p3)))) U (((p59 <= 0)) OR ((1 <= p62)))) OR ((((p39 <= 0)) OR ((1 <= p3))) AND (((p59 <= 0)) OR ((1 <= p62))))) U G ((((p39 <= 0)) OR ((1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((F ((((p39 <= 0)) OR ((1 <= p3)))) U (((p59 <= 0)) OR ((1 <= p62)))) OR ((((p39 <= 0)) OR ((1 <= p3))) AND (((p59 <= 0)) OR ((1 <= p62))))) U G ((((p39 <= 0)) OR ((1 <= p3)))))
lola: processed formula length: 183
lola: 21 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: 1882022 markings, 5750598 edges, 376404 markings/sec, 0 secs
lola: 3772770 markings, 11945845 edges, 378150 markings/sec, 5 secs
lola: 5511987 markings, 17799649 edges, 347843 markings/sec, 10 secs
lola: 7238213 markings, 23498738 edges, 345245 markings/sec, 15 secs
lola: 9050359 markings, 29650706 edges, 362429 markings/sec, 20 secs
lola: 10707339 markings, 35507146 edges, 331396 markings/sec, 25 secs
lola: 12410521 markings, 41277875 edges, 340636 markings/sec, 30 secs
lola: 13939594 markings, 46398608 edges, 305815 markings/sec, 35 secs
lola: 15559595 markings, 51682900 edges, 324000 markings/sec, 40 secs
lola: 17166412 markings, 57248943 edges, 321363 markings/sec, 45 secs
lola: 18639386 markings, 62467090 edges, 294595 markings/sec, 50 secs
lola: 19987835 markings, 67055077 edges, 269690 markings/sec, 55 secs
lola: 21373034 markings, 72083719 edges, 277040 markings/sec, 60 secs
lola: 22632566 markings, 76399455 edges, 251906 markings/sec, 65 secs
lola: 23919042 markings, 80793101 edges, 257295 markings/sec, 70 secs
lola: 25367370 markings, 86088987 edges, 289666 markings/sec, 75 secs
lola: 26908621 markings, 91412462 edges, 308250 markings/sec, 80 secs
lola: 28323834 markings, 96484196 edges, 283043 markings/sec, 85 secs
lola: 29583044 markings, 101374305 edges, 251842 markings/sec, 90 secs
lola: 30674487 markings, 106289105 edges, 218289 markings/sec, 95 secs
lola: 31879038 markings, 111179551 edges, 240910 markings/sec, 100 secs
lola: 33118950 markings, 116169062 edges, 247982 markings/sec, 105 secs
lola: 34134967 markings, 120445603 edges, 203203 markings/sec, 110 secs
lola: 35140150 markings, 125001361 edges, 201037 markings/sec, 115 secs
lola: 36124712 markings, 129379915 edges, 196912 markings/sec, 120 secs
lola: 37321772 markings, 133944075 edges, 239412 markings/sec, 125 secs
lola: 38413114 markings, 138278780 edges, 218268 markings/sec, 130 secs
lola: 39355676 markings, 142619820 edges, 188512 markings/sec, 135 secs
lola: 40315142 markings, 147051952 edges, 191893 markings/sec, 140 secs
lola: 41310505 markings, 151515481 edges, 199073 markings/sec, 145 secs
lola: 42571512 markings, 156160828 edges, 252201 markings/sec, 150 secs
lola: 43831088 markings, 160967406 edges, 251915 markings/sec, 155 secs
lola: 44908995 markings, 165555533 edges, 215581 markings/sec, 160 secs
lola: 45999515 markings, 170120661 edges, 218104 markings/sec, 165 secs
lola: 47071363 markings, 174612571 edges, 214370 markings/sec, 170 secs
lola: 47982225 markings, 178795137 edges, 182172 markings/sec, 175 secs
lola: 49075959 markings, 183320021 edges, 218747 markings/sec, 180 secs
lola: 50257457 markings, 187873605 edges, 236300 markings/sec, 185 secs
lola: 51330449 markings, 192456798 edges, 214598 markings/sec, 190 secs
lola: 52411625 markings, 197177306 edges, 216235 markings/sec, 195 secs
lola: 53582824 markings, 201840359 edges, 234240 markings/sec, 200 secs
lola: 54684024 markings, 206625678 edges, 220240 markings/sec, 205 secs
lola: 55782214 markings, 211188792 edges, 219638 markings/sec, 210 secs
lola: 57288243 markings, 216076363 edges, 301206 markings/sec, 215 secs
lola: 58666556 markings, 220712975 edges, 275663 markings/sec, 220 secs
lola: 59832258 markings, 224674673 edges, 233140 markings/sec, 225 secs
lola: 60933133 markings, 228784106 edges, 220175 markings/sec, 230 secs
lola: 62082934 markings, 233108455 edges, 229960 markings/sec, 235 secs
lola: 63176455 markings, 237811967 edges, 218704 markings/sec, 240 secs
lola: 64327760 markings, 242501540 edges, 230261 markings/sec, 245 secs
lola: 65374121 markings, 247038955 edges, 209272 markings/sec, 250 secs
lola: 66488282 markings, 251955389 edges, 222832 markings/sec, 255 secs
lola: 67546393 markings, 256558003 edges, 211622 markings/sec, 260 secs
lola: 68613228 markings, 261051280 edges, 213367 markings/sec, 265 secs
lola: 69868818 markings, 265546370 edges, 251118 markings/sec, 270 secs
lola: 70909235 markings, 269946200 edges, 208083 markings/sec, 275 secs
lola: 72460793 markings, 275079267 edges, 310312 markings/sec, 280 secs
lola: 74230050 markings, 280935615 edges, 353851 markings/sec, 285 secs
lola: 76038930 markings, 286705008 edges, 361776 markings/sec, 290 secs
lola: 77578377 markings, 292248092 edges, 307889 markings/sec, 295 secs
lola: 79399025 markings, 297585776 edges, 364130 markings/sec, 300 secs
lola: 80794831 markings, 302634532 edges, 279161 markings/sec, 305 secs
lola: 82413699 markings, 307786681 edges, 323774 markings/sec, 310 secs
lola: 83973948 markings, 312911069 edges, 312050 markings/sec, 315 secs
lola: 85244122 markings, 317902836 edges, 254035 markings/sec, 320 secs
lola: 86513903 markings, 322802977 edges, 253956 markings/sec, 325 secs
lola: 87716024 markings, 329098429 edges, 240424 markings/sec, 330 secs
lola: 89274371 markings, 335006195 edges, 311669 markings/sec, 335 secs
lola: 90738393 markings, 340702294 edges, 292804 markings/sec, 340 secs
lola: 92188122 markings, 345932935 edges, 289946 markings/sec, 345 secs
lola: 93463364 markings, 351109417 edges, 255048 markings/sec, 350 secs
lola: 95108521 markings, 356603829 edges, 329031 markings/sec, 355 secs
lola: 96649160 markings, 362152129 edges, 308128 markings/sec, 360 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: 97956235 markings, 367387722 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes
lola:
preliminary result: no no no no no yes
lola: memory consumption: 28204 KB
lola: time consumption: 484 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="ShieldIIPs-PT-003A"
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 ShieldIIPs-PT-003A, 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 r211-tajo-159033476900073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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