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-159033477400401.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 ShieldPPPs-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477400401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 2.9K May 14 01:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 01:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 18:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:36 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 18K 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 ShieldPPPs-PT-001B-00
FORMULA_NAME ShieldPPPs-PT-001B-01
FORMULA_NAME ShieldPPPs-PT-001B-02
FORMULA_NAME ShieldPPPs-PT-001B-03
FORMULA_NAME ShieldPPPs-PT-001B-04
FORMULA_NAME ShieldPPPs-PT-001B-05
FORMULA_NAME ShieldPPPs-PT-001B-06
FORMULA_NAME ShieldPPPs-PT-001B-07
FORMULA_NAME ShieldPPPs-PT-001B-08
FORMULA_NAME ShieldPPPs-PT-001B-09
FORMULA_NAME ShieldPPPs-PT-001B-10
FORMULA_NAME ShieldPPPs-PT-001B-11
FORMULA_NAME ShieldPPPs-PT-001B-12
FORMULA_NAME ShieldPPPs-PT-001B-13
FORMULA_NAME ShieldPPPs-PT-001B-14
FORMULA_NAME ShieldPPPs-PT-001B-15

=== Now, execution of the tool begins

BK_START 1591304072070

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:54:33] [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 20:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:54:33] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-06-04 20:54:33] [INFO ] Transformed 71 places.
[2020-06-04 20:54:33] [INFO ] Transformed 66 transitions.
[2020-06-04 20:54:33] [INFO ] Found NUPN structural information;
[2020-06-04 20:54:33] [INFO ] Parsed PT model containing 71 places and 66 transitions in 70 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 326 resets, run finished after 146 ms. (steps per millisecond=684 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 66 rows 71 cols
[2020-06-04 20:54:33] [INFO ] Computed 12 place invariants in 4 ms
[2020-06-04 20:54:33] [INFO ] [Real]Absence check using 12 positive place invariants in 16 ms returned sat
[2020-06-04 20:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:54:34] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-04 20:54:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:54:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned unsat
[2020-06-04 20:54:34] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2020-06-04 20:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:54:34] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2020-06-04 20:54:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:54:34] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 20:54:34] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2020-06-04 20:54:34] [INFO ] Flatten gal took : 28 ms
FORMULA ShieldPPPs-PT-001B-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-001B-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 20:54:34] [INFO ] Applying decomposition
[2020-06-04 20:54:34] [INFO ] Flatten gal took : 9 ms
[2020-06-04 20:54:34] [INFO ] Decomposing Gal with order
[2020-06-04 20:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 20:54:34] [INFO ] Removed a total of 6 redundant transitions.
[2020-06-04 20:54:34] [INFO ] Flatten gal took : 39 ms
[2020-06-04 20:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2020-06-04 20:54:34] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 20:54:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPs-PT-001B @ 3570 seconds

FORMULA ShieldPPPs-PT-001B-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-001B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3323
rslt: Output for LTLCardinality @ ShieldPPPs-PT-001B

{
"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 20:54:34 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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 ((((p9 <= 0)) OR ((1 <= p11)))))",
"processed_size": 38,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "G (F (((X ((((p66 <= 0)) OR ((1 <= p15)))) U G ((((p59 <= 0)) OR ((1 <= p38))))) AND ((1 <= p2)))))",
"processed_size": 101,
"rewrites": 43
},
"result":
{
"edges": 132754151,
"markings": 14784289,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 490
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((F ((((p23 <= 0)) OR ((1 <= p25)))) OR G ((F ((((p18 <= 0)) OR ((1 <= p60)))) OR (((p18 <= 0)) OR ((1 <= p18)))))))",
"processed_size": 120,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"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": 571
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((((1 <= p31)) AND ((p29 <= 0))))) AND X ((((1 <= p31)) AND ((p29 <= 0)))))))",
"processed_size": 89,
"rewrites": 43
},
"result":
{
"edges": 133,
"markings": 133,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 686
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((((p36 <= 0)) OR ((1 <= p70)))))",
"processed_size": 39,
"rewrites": 43
},
"result":
{
"edges": 133,
"markings": 133,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 857
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "X (F (((((((p7 <= 0)) OR ((1 <= p22))) AND (((p65 <= 0)) OR ((1 <= p18)))) U (((p65 <= 0)) OR ((1 <= p18)))) OR ((((p7 <= 0)) OR ((1 <= p22))) U (((p31 <= 0)) OR ((1 <= p30)))))))",
"processed_size": 184,
"rewrites": 43
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1143
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 3,
"aconj": 8,
"adisj": 7,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))) OR (G ((((p50 <= 0)) OR ((1 <= p11)))) AND (X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))))))",
"processed_size": 212,
"rewrites": 43
},
"result":
{
"edges": 70223188,
"markings": 10978316,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"compoundnumber": 6,
"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": 1673
},
"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": "F (G ((((p60 <= 0)) OR ((1 <= p7)))))",
"processed_size": 38,
"rewrites": 43
},
"result":
{
"edges": 19086161,
"markings": 4688887,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 3323
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "F (G ((((1 <= p60)) AND ((p18 <= 0)))))",
"processed_size": 39,
"rewrites": 43
},
"result":
{
"edges": 82,
"markings": 81,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30436,
"runtime": 247.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : F(G(*)) : G(F(((X(**) U G(**)) AND **))) : F(G(**)) : X((F(**) OR G((F(**) OR (** OR **))))) : X(G((G(F(*)) AND X(**)))) : X(G(**)) : X(F(((** U **) OR (** U **)))) : X(F((G((X(F(*)) OR *)) OR (G(**) AND (X(F(*)) OR *)))))"
},
"net":
{
"arcs": 180,
"conflict_clusters": 51,
"places": 71,
"places_significant": 59,
"singleton_clusters": 0,
"transitions": 66
},
"result":
{
"preliminary_value": "yes no no yes yes no no yes yes ",
"value": "yes no no yes yes no no 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: 137/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2272
lola: finding significant places
lola: 71 places, 66 transitions, 59 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: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: X (((0 <= 0) U (((p9 <= 0)) OR ((1 <= p11))))) : F (X (NOT(G (F (((1 <= 0) U ((1 <= 0) U (((p60 <= 0)) OR ((1 <= p18)))))))))) : G (F (X (((X ((((p66 <= 0)) OR ((1 <= p15)))) U G ((((p59 <= 0)) OR ((1 <= p38))))) AND ((1 <= p2)))))) : F (G ((((p60 <= 0)) OR ((1 <= p7))))) : (F (((((p36 <= 0)) OR ((1 <= p26))) U X (F ((((p23 <= 0)) OR ((1 <= p25))))))) OR X (G (((F ((((p18 <= 0)) OR ((1 <= p60)))) OR ((p18 <= 0))) OR ((1 <= p18)))))) : X (G ((G (NOT(G ((((p31 <= 0)) OR ((1 <= p29)))))) AND X ((((1 <= p31)) AND ((p29 <= 0))))))) : X (G ((((p36 <= 0)) OR ((1 <= p70))))) : F (X (F (((((((p7 <= 0)) OR ((1 <= p22))) AND (((p65 <= 0)) OR ((1 <= p18)))) U (((p65 <= 0)) OR ((1 <= p18)))) OR ((((p7 <= 0)) OR ((1 <= p22))) U (((p31 <= 0)) OR ((1 <= p30)))))))) : X (NOT(G ((NOT(G ((((p50 <= 0)) OR ((1 <= p11))))) U (X (G ((((1 <= p18)) AND ((p43 <= 0))))) AND (((p50 <= 0)) OR ((1 <= p11))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p9 <= 0)) OR ((1 <= p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p9 <= 0)) OR ((1 <= p11)))))
lola: processed formula length: 38
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((X ((((p66 <= 0)) OR ((1 <= p15)))) U G ((((p59 <= 0)) OR ((1 <= p38))))) AND ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((X ((((p66 <= 0)) OR ((1 <= p15)))) U G ((((p59 <= 0)) OR ((1 <= p38))))) AND ((1 <= p2)))))
lola: processed formula length: 101
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 950324 markings, 5010580 edges, 190065 markings/sec, 0 secs
lola: 1469442 markings, 10731375 edges, 103824 markings/sec, 5 secs
lola: 2389186 markings, 14943103 edges, 183949 markings/sec, 10 secs
lola: 3172885 markings, 19553783 edges, 156740 markings/sec, 15 secs
lola: 3792455 markings, 25284272 edges, 123914 markings/sec, 20 secs
lola: 4255200 markings, 30734955 edges, 92549 markings/sec, 25 secs
lola: 4476179 markings, 35721079 edges, 44196 markings/sec, 30 secs
lola: 5276104 markings, 39919668 edges, 159985 markings/sec, 35 secs
lola: 6255069 markings, 44302264 edges, 195793 markings/sec, 40 secs
lola: 7060704 markings, 49489906 edges, 161127 markings/sec, 45 secs
lola: 7630461 markings, 54861827 edges, 113951 markings/sec, 50 secs
lola: 8112193 markings, 60201704 edges, 96346 markings/sec, 55 secs
lola: 8573389 markings, 65802668 edges, 92239 markings/sec, 60 secs
lola: 8674997 markings, 70252746 edges, 20322 markings/sec, 65 secs
lola: 8860073 markings, 74638030 edges, 37015 markings/sec, 70 secs
lola: 9919652 markings, 78555225 edges, 211916 markings/sec, 75 secs
lola: 10636955 markings, 82627935 edges, 143461 markings/sec, 80 secs
lola: 11180735 markings, 87212453 edges, 108756 markings/sec, 85 secs
lola: 11594940 markings, 91931138 edges, 82841 markings/sec, 90 secs
lola: 11977366 markings, 96610871 edges, 76485 markings/sec, 95 secs
lola: 12060610 markings, 100253298 edges, 16649 markings/sec, 100 secs
lola: 12269121 markings, 103893597 edges, 41702 markings/sec, 105 secs
lola: 13008301 markings, 107979782 edges, 147836 markings/sec, 110 secs
lola: 13439597 markings, 112864935 edges, 86259 markings/sec, 115 secs
lola: 13861078 markings, 118137957 edges, 84296 markings/sec, 120 secs
lola: 14234328 markings, 124077859 edges, 74650 markings/sec, 125 secs
lola: 14617562 markings, 130108143 edges, 76647 markings/sec, 130 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: 14784289 markings, 132754151 edges
lola: ========================================
lola: subprocess 2 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p23 <= 0)) OR ((1 <= p25)))) OR G ((F ((((p18 <= 0)) OR ((1 <= p60)))) OR (((p18 <= 0)) OR ((1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p23 <= 0)) OR ((1 <= p25)))) OR G ((F ((((p18 <= 0)) OR ((1 <= p60)))) OR (((p18 <= 0)) OR ((1 <= p18)))))))
lola: processed formula length: 120
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((((1 <= p31)) AND ((p29 <= 0))))) AND X ((((1 <= p31)) AND ((p29 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((((1 <= p31)) AND ((p29 <= 0))))) AND X ((((1 <= p31)) AND ((p29 <= 0)))))))
lola: processed formula length: 89
lola: 43 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: 133 markings, 133 edges
lola: ========================================
lola: subprocess 4 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p36 <= 0)) OR ((1 <= p70)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p36 <= 0)) OR ((1 <= p70)))))
lola: processed formula length: 39
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 133 markings, 133 edges
lola: ========================================
lola: subprocess 5 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((((((p7 <= 0)) OR ((1 <= p22))) AND (((p65 <= 0)) OR ((1 <= p18)))) U (((p65 <= 0)) OR ((1 <= p18)))) OR ((((p7 <= 0)) OR ((1 <= p22))) U (((p31 <= 0)) OR ((1 <= p30)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((((((p7 <= 0)) OR ((1 <= p22))) AND (((p65 <= 0)) OR ((1 <= p18)))) U (((p65 <= 0)) OR ((1 <= p18)))) OR ((((p7 <= 0)) OR ((1 <= p22))) U (((p31 <= 0)) OR ((1 <= p30)))))))
lola: processed formula length: 184
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 1143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))) OR (G ((((p50 <= 0)) OR ((1 <= p11)))) AND (X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))) OR (G ((((p50 <= 0)) OR ((1 <= p11)))) AND (X (F ((((p18 <= 0)) OR ((1 <= p43))))) OR (((1 <= p50)) AND ((p11 <= 0))))))))
lola: processed formula length: 212
lola: 43 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: 1069646 markings, 5256158 edges, 213929 markings/sec, 0 secs
lola: 2058386 markings, 9629393 edges, 197748 markings/sec, 5 secs
lola: 2788498 markings, 13682173 edges, 146022 markings/sec, 10 secs
lola: 3325048 markings, 17828340 edges, 107310 markings/sec, 15 secs
lola: 3940698 markings, 21717810 edges, 123130 markings/sec, 20 secs
lola: 4828317 markings, 25283052 edges, 177524 markings/sec, 25 secs
lola: 5522159 markings, 29045044 edges, 138768 markings/sec, 30 secs
lola: 6159732 markings, 33177589 edges, 127515 markings/sec, 35 secs
lola: 6481202 markings, 36819747 edges, 64294 markings/sec, 40 secs
lola: 6621420 markings, 39860504 edges, 28044 markings/sec, 45 secs
lola: 7557049 markings, 43348933 edges, 187126 markings/sec, 50 secs
lola: 8207701 markings, 46836324 edges, 130130 markings/sec, 55 secs
lola: 8828522 markings, 50832394 edges, 124164 markings/sec, 60 secs
lola: 9072459 markings, 55006360 edges, 48787 markings/sec, 65 secs
lola: 9887188 markings, 59712075 edges, 162946 markings/sec, 70 secs
lola: 10486577 markings, 64976931 edges, 119878 markings/sec, 75 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: 10978316 markings, 70223188 edges
lola: ========================================
lola: subprocess 7 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p60 <= 0)) OR ((1 <= p7)))))
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 ((((p60 <= 0)) OR ((1 <= p7)))))
lola: processed formula length: 38
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1342899 markings, 4901498 edges, 268580 markings/sec, 0 secs
lola: 2372641 markings, 8569566 edges, 205948 markings/sec, 5 secs
lola: 3353152 markings, 12526655 edges, 196102 markings/sec, 10 secs
lola: 4218715 markings, 16554608 edges, 173113 markings/sec, 15 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: 4688887 markings, 19086161 edges
lola: ========================================
lola: subprocess 8 will run for 3323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p60)) AND ((p18 <= 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 <= p60)) AND ((p18 <= 0)))))
lola: processed formula length: 39
lola: 43 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 81 markings, 82 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes no no yes yes
lola:
preliminary result: yes no no yes yes no no yes yes
lola: memory consumption: 30436 KB
lola: time consumption: 247 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="ShieldPPPs-PT-001B"
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 ShieldPPPs-PT-001B, 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-159033477400401"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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