Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r227-tall-162098230800089.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is ShieldIIPs-PT-002A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230800089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 18K May 5 16:52 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-002A-00
FORMULA_NAME ShieldIIPs-PT-002A-01
FORMULA_NAME ShieldIIPs-PT-002A-02
FORMULA_NAME ShieldIIPs-PT-002A-03
FORMULA_NAME ShieldIIPs-PT-002A-04
FORMULA_NAME ShieldIIPs-PT-002A-05
FORMULA_NAME ShieldIIPs-PT-002A-06
FORMULA_NAME ShieldIIPs-PT-002A-07
FORMULA_NAME ShieldIIPs-PT-002A-08
FORMULA_NAME ShieldIIPs-PT-002A-09
FORMULA_NAME ShieldIIPs-PT-002A-10
FORMULA_NAME ShieldIIPs-PT-002A-11
FORMULA_NAME ShieldIIPs-PT-002A-12
FORMULA_NAME ShieldIIPs-PT-002A-13
FORMULA_NAME ShieldIIPs-PT-002A-14
FORMULA_NAME ShieldIIPs-PT-002A-15

=== Now, execution of the tool begins

BK_START 1621121800081

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

FORMULA ShieldIIPs-PT-002A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-002A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 23:36:44 2021
",
"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": 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": "(((p48 <= 0)) OR ((1 <= p2)))",
"processed_size": 30,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 5,
"adisj": 4,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G (((((p17 <= 0)) OR ((1 <= p18))) AND (((p2 <= 0)) OR ((1 <= p49)))))) AND (((1 <= p2)) AND ((p49 <= 0)))))",
"processed_size": 117,
"rewrites": 39
},
"result":
{
"edges": 127,
"markings": 127,
"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"
}
}
],
"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": 2,
"G": 2,
"U": 0,
"X": 4,
"aconj": 10,
"adisj": 4,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((X (X (G ((((1 <= p21)) AND ((p14 <= 0)) AND ((1 <= p52)) AND ((p5 <= 0)))))) OR F (((((1 <= p26)) AND ((p2 <= 0))) AND (F ((((1 <= p26)) AND ((p2 <= 0)))) OR G ((((1 <= p26)) AND ((p2 <= 0))))))))))",
"processed_size": 205,
"rewrites": 39
},
"result":
{
"edges": 29313,
"markings": 4257,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((((1 <= p9)) AND ((p43 <= 0)))) OR G (F ((((p22 <= 0)) OR ((1 <= p0)))))))",
"processed_size": 82,
"rewrites": 39
},
"result":
{
"edges": 365873949,
"markings": 59223028,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1043
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p35 <= 0)) OR ((1 <= p38)))",
"processed_size": 31,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G (((1 <= p27))))",
"processed_size": 20,
"rewrites": 39
},
"result":
{
"edges": 173,
"markings": 172,
"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": 3129
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3129
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p6))",
"processed_size": 11,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p6))",
"processed_size": 11,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 ((((p23 <= 0)) OR ((1 <= p19))))",
"processed_size": 35,
"rewrites": 39
},
"result":
{
"edges": 158,
"markings": 158,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25204,
"runtime": 441.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : (G(**) OR **) : (X((X(G(**)) AND (** AND **))) AND **) : F(*) : X(X((X(X(G(*))) OR F((* AND (F(*) OR G(*))))))) : F((X(*) OR G(F(**))))"
},
"net":
{
"arcs": 222,
"conflict_clusters": 17,
"places": 53,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 51
},
"result":
{
"preliminary_value": "no no no yes yes yes ",
"value": "no no no yes yes 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: 104/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 53
lola: finding significant places
lola: 53 places, 51 transitions, 34 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: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: F (F ((((1 <= p27)) U ((1 <= 0) U X (G (((1 <= p27)))))))) : (G ((((p23 <= 0)) OR ((1 <= p19)))) OR ((1 <= p6))) : (X (((X (G (((((p17 <= 0)) OR ((1 <= p18))) AND (((p2 <= 0)) OR ((1 <= p49)))))) AND ((1 <= p2))) AND ((p49 <= 0)))) AND (((p48 <= 0)) OR ((1 <= p2)))) : NOT(G ((((p35 <= 0)) OR ((1 <= p38))))) : X (NOT(X ((X (F (X ((((p21 <= 0)) OR ((1 <= p14)) OR ((p52 <= 0)) OR ((1 <= p5)))))) AND G ((G ((((p26 <= 0)) OR ((1 <= p2)))) U (((p26 <= 0)) OR ((1 <= p2))))))))) : F ((NOT(X ((((p9 <= 0)) OR ((1 <= p43))))) OR NOT(F (NOT(X (F (X ((((p22 <= 0)) OR ((1 <= p0)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:300
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 ((X (G (((((p17 <= 0)) OR ((1 <= p18))) AND (((p2 <= 0)) OR ((1 <= p49)))))) AND (((1 <= p2)) AND ((p49 <= 0))))) AND (((p48 <= 0)) OR ((1 <= p2))))
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: (((p48 <= 0)) OR ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p48 <= 0)) OR ((1 <= p2)))
lola: processed formula length: 30
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((((p17 <= 0)) OR ((1 <= p18))) AND (((p2 <= 0)) OR ((1 <= p49)))))) AND (((1 <= p2)) AND ((p49 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((((p17 <= 0)) OR ((1 <= p18))) AND (((p2 <= 0)) OR ((1 <= p49)))))) AND (((1 <= p2)) AND ((p49 <= 0)))))
lola: processed formula length: 117
lola: 39 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: 127 markings, 127 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 (X ((X (X (G ((((1 <= p21)) AND ((p14 <= 0)) AND ((1 <= p52)) AND ((p5 <= 0)))))) OR F (((((1 <= p26)) AND ((p2 <= 0))) AND (F ((((1 <= p26)) AND ((p2 <= 0)))) OR G ((((1 <= p26)) AND ((p2 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (X (G ((((1 <= p21)) AND ((p14 <= 0)) AND ((1 <= p52)) AND ((p5 <= 0)))))) OR F (((((1 <= p26)) AND ((p2 <= 0))) AND (F ((((1 <= p26)) AND ((p2 <= 0)))) OR G ((((1 <= p26)) AND ((p2 <= 0))))))))))
lola: processed formula length: 205
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 4257 markings, 29313 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((((1 <= p9)) AND ((p43 <= 0)))) OR G (F ((((p22 <= 0)) OR ((1 <= p0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((((1 <= p9)) AND ((p43 <= 0)))) OR G (F ((((p22 <= 0)) OR ((1 <= p0)))))))
lola: processed formula length: 82
lola: 39 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: 1298108 markings, 5586825 edges, 259622 markings/sec, 0 secs
lola: 2167201 markings, 10413767 edges, 173819 markings/sec, 5 secs
lola: 2922781 markings, 14983020 edges, 151116 markings/sec, 10 secs
lola: 3739403 markings, 19619857 edges, 163324 markings/sec, 15 secs
lola: 4574306 markings, 24362048 edges, 166981 markings/sec, 20 secs
lola: 5190823 markings, 28607256 edges, 123303 markings/sec, 25 secs
lola: 5907242 markings, 32704847 edges, 143284 markings/sec, 30 secs
lola: 6539983 markings, 36556474 edges, 126548 markings/sec, 35 secs
lola: 7002109 markings, 40271270 edges, 92425 markings/sec, 40 secs
lola: 7696741 markings, 44860139 edges, 138926 markings/sec, 45 secs
lola: 8395395 markings, 49220323 edges, 139731 markings/sec, 50 secs
lola: 9015399 markings, 53218717 edges, 124001 markings/sec, 55 secs
lola: 9595140 markings, 57108773 edges, 115948 markings/sec, 60 secs
lola: 10282820 markings, 62382153 edges, 137536 markings/sec, 65 secs
lola: 11088729 markings, 66928803 edges, 161182 markings/sec, 70 secs
lola: 11663101 markings, 71398903 edges, 114874 markings/sec, 75 secs
lola: 12491208 markings, 76227103 edges, 165621 markings/sec, 80 secs
lola: 13208032 markings, 80504935 edges, 143365 markings/sec, 85 secs
lola: 13927885 markings, 84724016 edges, 143971 markings/sec, 90 secs
lola: 14473573 markings, 88396988 edges, 109138 markings/sec, 95 secs
lola: 15257412 markings, 92508840 edges, 156768 markings/sec, 100 secs
lola: 15739583 markings, 96240468 edges, 96434 markings/sec, 105 secs
lola: 16427988 markings, 100560581 edges, 137681 markings/sec, 110 secs
lola: 17214610 markings, 104680575 edges, 157324 markings/sec, 115 secs
lola: 17841474 markings, 108511915 edges, 125373 markings/sec, 120 secs
lola: 18345900 markings, 112480991 edges, 100885 markings/sec, 125 secs
lola: 19007897 markings, 116305555 edges, 132399 markings/sec, 130 secs
lola: 19545352 markings, 119669882 edges, 107491 markings/sec, 135 secs
lola: 20123145 markings, 123864156 edges, 115559 markings/sec, 140 secs
lola: 20816876 markings, 127858301 edges, 138746 markings/sec, 145 secs
lola: 21402089 markings, 132276461 edges, 117043 markings/sec, 150 secs
lola: 22051378 markings, 137150403 edges, 129858 markings/sec, 155 secs
lola: 22884308 markings, 141656931 edges, 166586 markings/sec, 160 secs
lola: 23502044 markings, 145817413 edges, 123547 markings/sec, 165 secs
lola: 23909331 markings, 149534318 edges, 81457 markings/sec, 170 secs
lola: 24489987 markings, 153301025 edges, 116131 markings/sec, 175 secs
lola: 25072526 markings, 157274957 edges, 116508 markings/sec, 180 secs
lola: 25687691 markings, 161123154 edges, 123033 markings/sec, 185 secs
lola: 26348569 markings, 165069556 edges, 132176 markings/sec, 190 secs
lola: 27029888 markings, 169060355 edges, 136264 markings/sec, 195 secs
lola: 27723081 markings, 172846765 edges, 138639 markings/sec, 200 secs
lola: 28234614 markings, 176539597 edges, 102307 markings/sec, 205 secs
lola: 28841067 markings, 180072222 edges, 121291 markings/sec, 210 secs
lola: 29466060 markings, 183775415 edges, 124999 markings/sec, 215 secs
lola: 30016748 markings, 187421068 edges, 110138 markings/sec, 220 secs
lola: 30715343 markings, 191173521 edges, 139719 markings/sec, 225 secs
lola: 31247934 markings, 195138861 edges, 106518 markings/sec, 230 secs
lola: 31919477 markings, 199204534 edges, 134309 markings/sec, 235 secs
lola: 32515830 markings, 202744196 edges, 119271 markings/sec, 240 secs
lola: 33115650 markings, 206873917 edges, 119964 markings/sec, 245 secs
lola: 33884123 markings, 210890487 edges, 153695 markings/sec, 250 secs
lola: 34424919 markings, 214533476 edges, 108159 markings/sec, 255 secs
lola: 34967808 markings, 218472872 edges, 108578 markings/sec, 260 secs
lola: 35678864 markings, 223253676 edges, 142211 markings/sec, 265 secs
lola: 36238925 markings, 227470834 edges, 112012 markings/sec, 270 secs
lola: 36888659 markings, 231593780 edges, 129947 markings/sec, 275 secs
lola: 37529875 markings, 236066139 edges, 128243 markings/sec, 280 secs
lola: 38273407 markings, 240133112 edges, 148706 markings/sec, 285 secs
lola: 38832543 markings, 243909356 edges, 111827 markings/sec, 290 secs
lola: 39461623 markings, 248507785 edges, 125816 markings/sec, 295 secs
lola: 40189333 markings, 253536571 edges, 145542 markings/sec, 300 secs
lola: 40799083 markings, 258142732 edges, 121950 markings/sec, 305 secs
lola: 41587704 markings, 262471685 edges, 157724 markings/sec, 310 secs
lola: 42277108 markings, 266705700 edges, 137881 markings/sec, 315 secs
lola: 43022415 markings, 270631275 edges, 149061 markings/sec, 320 secs
lola: 43568145 markings, 274249119 edges, 109146 markings/sec, 325 secs
lola: 44257693 markings, 278061995 edges, 137910 markings/sec, 330 secs
lola: 44898326 markings, 281956675 edges, 128127 markings/sec, 335 secs
lola: 45505256 markings, 285866579 edges, 121386 markings/sec, 340 secs
lola: 46272275 markings, 290018464 edges, 153404 markings/sec, 345 secs
lola: 46868628 markings, 293777890 edges, 119271 markings/sec, 350 secs
lola: 47549142 markings, 298082025 edges, 136103 markings/sec, 355 secs
lola: 48224163 markings, 301968548 edges, 135004 markings/sec, 360 secs
lola: 48879096 markings, 306247081 edges, 130987 markings/sec, 365 secs
lola: 49620964 markings, 310466731 edges, 148374 markings/sec, 370 secs
lola: 50327658 markings, 314908410 edges, 141339 markings/sec, 375 secs
lola: 51018011 markings, 319048692 edges, 138071 markings/sec, 380 secs
lola: 51623423 markings, 323197229 edges, 121082 markings/sec, 385 secs
lola: 52370824 markings, 327900136 edges, 149480 markings/sec, 390 secs
lola: 53167479 markings, 332295434 edges, 159331 markings/sec, 395 secs
lola: 53910501 markings, 336454915 edges, 148604 markings/sec, 400 secs
lola: 54660382 markings, 340642589 edges, 149976 markings/sec, 405 secs
lola: 55367849 markings, 344838320 edges, 141493 markings/sec, 410 secs
lola: 56130129 markings, 349149471 edges, 152456 markings/sec, 415 secs
lola: 56898693 markings, 353545693 edges, 153713 markings/sec, 420 secs
lola: 57681673 markings, 358081284 edges, 156596 markings/sec, 425 secs
lola: 58581470 markings, 362589546 edges, 179959 markings/sec, 430 secs
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: 59223028 markings, 365873949 edges
lola: ========================================
lola: subprocess 3 will run for 1043 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p35)) AND ((p38 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p35 <= 0)) OR ((1 <= p38)))
lola: processed formula length: 31
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p27))))
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 <= p27))))
lola: processed formula length: 20
lola: 39 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: 172 markings, 173 edges
lola: ========================================
lola: subprocess 5 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((p23 <= 0)) OR ((1 <= p19)))) OR ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6))
lola: processed formula length: 11
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((((p23 <= 0)) OR ((1 <= p19)))) OR ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p6))
lola: processed formula length: 11
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((((p23 <= 0)) OR ((1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p23 <= 0)) OR ((1 <= p19))))
lola: processed formula length: 35
lola: 39 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: 158 markings, 158 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes yes
lola:
preliminary result: no no no yes yes yes
lola: memory consumption: 25204 KB
lola: time consumption: 441 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-002A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is ShieldIIPs-PT-002A, 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 r227-tall-162098230800089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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