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.r094-tall-162048902500201.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 DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 129K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 33K May 5 16:51 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 DoubleExponent-PT-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15

=== Now, execution of the tool begins

BK_START 1620745880101

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:11:21] [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-11 15:11:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:11:21] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-11 15:11:21] [INFO ] Transformed 110 places.
[2021-05-11 15:11:21] [INFO ] Transformed 98 transitions.
[2021-05-11 15:11:21] [INFO ] Parsed PT model containing 110 places and 98 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3293 resets, run finished after 319 ms. (steps per millisecond=313 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 98 rows 110 cols
[2021-05-11 15:11:22] [INFO ] Computed 14 place invariants in 8 ms
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-11 15:11:22] [INFO ] Deduced a trap composed of 18 places in 53 ms
[2021-05-11 15:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-11 15:11:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-11 15:11:22] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2021-05-11 15:11:22] [INFO ] Deduced a trap composed of 18 places in 31 ms
[2021-05-11 15:11:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-11 15:11:22] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 9 ms.
[2021-05-11 15:11:22] [INFO ] Added : 93 causal constraints over 19 iterations in 171 ms. Result :sat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:22] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-11 15:11:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:22] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2021-05-11 15:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-11 15:11:23] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2021-05-11 15:11:23] [INFO ] Added : 94 causal constraints over 19 iterations in 151 ms. Result :sat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-11 15:11:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 36 places in 32 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 55 places in 33 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 44 places in 29 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 38 places in 31 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2021-05-11 15:11:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 227 ms
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 30 places in 24 ms
[2021-05-11 15:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2021-05-11 15:11:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:23] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2021-05-11 15:11:23] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2021-05-11 15:11:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2021-05-11 15:11:23] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2021-05-11 15:11:24] [INFO ] Added : 95 causal constraints over 19 iterations in 145 ms. Result :sat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-11 15:11:24] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2021-05-11 15:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-11 15:11:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-11 15:11:24] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2021-05-11 15:11:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-11 15:11:24] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2021-05-11 15:11:24] [INFO ] Added : 97 causal constraints over 20 iterations in 158 ms. Result :sat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:24] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-11 15:11:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2021-05-11 15:11:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:24] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-11 15:11:24] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2021-05-11 15:11:24] [INFO ] Added : 93 causal constraints over 19 iterations in 142 ms. Result :sat
[2021-05-11 15:11:24] [INFO ] Deduced a trap composed of 24 places in 26 ms
[2021-05-11 15:11:24] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2021-05-11 15:11:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
Successfully simplified 18 atomic propositions for a total of 20 simplifications.
[2021-05-11 15:11:25] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-11 15:11:25] [INFO ] Flatten gal took : 35 ms
FORMULA DoubleExponent-PT-002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 15:11:25] [INFO ] Flatten gal took : 11 ms
[2021-05-11 15:11:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 15:11:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DoubleExponent-PT-002 @ 3570 seconds

FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DoubleExponent-PT-002

{
"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": "Tue May 11 15:11:25 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((p67 <= p49)) OR X (G ((p30 <= p102))))))",
"processed_size": 51,
"rewrites": 39
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((p98 + 1 <= p80))) OR F ((p80 <= p98))))",
"processed_size": 50,
"rewrites": 39
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p59 <= p78)",
"processed_size": 12,
"rewrites": 39
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (F ((G ((p78 + 1 <= p59)) OR (p59 <= p78))))",
"processed_size": 46,
"rewrites": 39
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X ((p93 + 1 <= p21)) U (p11 <= p42)) U X ((1 <= p95))))",
"processed_size": 60,
"rewrites": 39
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p90 <= p94)))",
"processed_size": 20,
"rewrites": 39
},
"result":
{
"edges": 184,
"markings": 175,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p33 <= 0)))",
"processed_size": 18,
"rewrites": 39
},
"result":
{
"edges": 4105,
"markings": 3709,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p49)) AND ((p95 <= p105) OR (1 <= p49))))",
"processed_size": 54,
"rewrites": 39
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 19572,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((F(**) OR X(G(**))))) : X((X(G(*)) OR F(**))) : (X(F((G(*) OR *))) AND **) : F(G(*)) : X(((X(**) U **) U X(**))) : X(G(**)) : G((F(**) AND (** OR **)))"
},
"net":
{
"arcs": 276,
"conflict_clusters": 75,
"places": 110,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "yes yes yes yes no no no ",
"value": "yes yes yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 208/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3520
lola: finding significant places
lola: 110 places, 98 transitions, 96 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: NOT(G ((NOT(X (F ((p67 <= p49)))) AND NOT(X (G (X (((1 <= 0) U (p30 <= p102))))))))) : (NOT(X (X (F ((p80 <= p98))))) OR X (((0 <= 0) U (p80 <= p98)))) : (X (NOT(G ((F ((p59 <= p78)) AND (p78 + 1 <= p59))))) AND (p59 <= p78)) : F (NOT(((p36 <= p53) U F ((1 <= p33))))) : X (((X ((p93 + 1 <= p21)) U (p11 <= p42)) U X ((1 <= p95)))) : X (((1 <= 0) U G ((p90 <= p94)))) : G (((p95 <= p105) U (1 <= p49)))
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p67 <= p49)) OR X (G ((p30 <= p102))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p67 <= p49)) OR X (G ((p30 <= p102))))))
lola: processed formula length: 51
lola: 39 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: 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p98 + 1 <= p80))) OR F ((p80 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p98 + 1 <= p80))) OR F ((p80 <= p98))))
lola: processed formula length: 50
lola: 39 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: 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 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((p78 + 1 <= p59)) OR (p59 <= p78)))) AND (p59 <= p78))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p59 <= p78)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p59 <= p78)
lola: processed formula length: 12
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p78 + 1 <= p59)) OR (p59 <= p78))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p78 + 1 <= p59)) OR (p59 <= p78))))
lola: processed formula length: 46
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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X ((p93 + 1 <= p21)) U (p11 <= p42)) U X ((1 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X ((p93 + 1 <= p21)) U (p11 <= p42)) U X ((1 <= p95))))
lola: processed formula length: 60
lola: 39 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p90 <= p94)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p90 <= p94)))
lola: processed formula length: 20
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: 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: 175 markings, 184 edges
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p33 <= 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 ((p33 <= 0)))
lola: processed formula length: 18
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3709 markings, 4105 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p49)) AND ((p95 <= p105) OR (1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p49)) AND ((p95 <= p105) OR (1 <= p49))))
lola: processed formula length: 54
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: 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: 23 markings, 23 edges
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no
lola:
preliminary result: yes yes yes yes no no no
lola: ========================================
lola: memory consumption: 19572 KB
lola: time consumption: 3 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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r094-tall-162048902500201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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