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.r075-tall-162039097600381.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 Dekker-PT-015, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 141K 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 Dekker-PT-015-00
FORMULA_NAME Dekker-PT-015-01
FORMULA_NAME Dekker-PT-015-02
FORMULA_NAME Dekker-PT-015-03
FORMULA_NAME Dekker-PT-015-04
FORMULA_NAME Dekker-PT-015-05
FORMULA_NAME Dekker-PT-015-06
FORMULA_NAME Dekker-PT-015-07
FORMULA_NAME Dekker-PT-015-08
FORMULA_NAME Dekker-PT-015-09
FORMULA_NAME Dekker-PT-015-10
FORMULA_NAME Dekker-PT-015-11
FORMULA_NAME Dekker-PT-015-12
FORMULA_NAME Dekker-PT-015-13
FORMULA_NAME Dekker-PT-015-14
FORMULA_NAME Dekker-PT-015-15

=== Now, execution of the tool begins

BK_START 1620574756175

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 15:39:17] [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-09 15:39:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:39:17] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-09 15:39:17] [INFO ] Transformed 75 places.
[2021-05-09 15:39:17] [INFO ] Transformed 255 transitions.
[2021-05-09 15:39:17] [INFO ] Found NUPN structural information;
[2021-05-09 15:39:17] [INFO ] Parsed PT model containing 75 places and 255 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 493 ms. (steps per millisecond=202 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
[2021-05-09 15:39:18] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2021-05-09 15:39:18] [INFO ] Computed 45 place invariants in 4 ms
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-09 15:39:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-09 15:39:18] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-09 15:39:18] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:39:18] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 15:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2021-05-09 15:39:18] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 13 ms.
[2021-05-09 15:39:18] [INFO ] Added : 16 causal constraints over 4 iterations in 54 ms. Result :sat
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:18] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 15:39:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:39:18] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:39:18] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-09 15:39:18] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2021-05-09 15:39:18] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Added 15 Read/Feed constraints in 4 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2021-05-09 15:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2021-05-09 15:39:19] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 9 ms.
[2021-05-09 15:39:19] [INFO ] Added : 16 causal constraints over 4 iterations in 40 ms. Result :sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-09 15:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 11 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 40 ms
[2021-05-09 15:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 8 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 39 ms
[2021-05-09 15:39:19] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 7 ms.
[2021-05-09 15:39:19] [INFO ] Added : 16 causal constraints over 4 iterations in 36 ms. Result :sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned unsat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using 30 positive and 15 generalized place invariants in 2 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Real]Added 15 Read/Feed constraints in 2 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 9 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-09 15:39:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:39:19] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:39:19] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 5 places in 10 ms
[2021-05-09 15:39:19] [INFO ] Deduced a trap composed of 4 places in 7 ms
[2021-05-09 15:39:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-09 15:39:19] [INFO ] Computed and/alt/rep : 240/675/45 causal constraints in 13 ms.
[2021-05-09 15:39:19] [INFO ] Added : 16 causal constraints over 4 iterations in 42 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2021-05-09 15:39:20] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-09 15:39:20] [INFO ] Flatten gal took : 75 ms
FORMULA Dekker-PT-015-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:39:20] [INFO ] Applying decomposition
[2021-05-09 15:39:20] [INFO ] Flatten gal took : 28 ms
[2021-05-09 15:39:20] [INFO ] Decomposing Gal with order
[2021-05-09 15:39:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 15:39:20] [INFO ] Removed a total of 795 redundant transitions.
[2021-05-09 15:39:20] [INFO ] Flatten gal took : 67 ms
[2021-05-09 15:39:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-09 15:39:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-09 15:39:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-015 @ 3570 seconds

FORMULA Dekker-PT-015-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-015-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3559
rslt: Output for LTLCardinality @ Dekker-PT-015

{
"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": "Sun May 9 15:39:21 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((G ((((p53 <= 0)) OR ((1 <= p49)))) AND F (((1 <= p23))))))",
"processed_size": 66,
"rewrites": 38
},
"result":
{
"edges": 8899165,
"markings": 147466,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 509
},
"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 ((((p1 <= 0)) OR ((1 <= p62)))))",
"processed_size": 38,
"rewrites": 38
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((p53 <= 0))))",
"processed_size": 20,
"rewrites": 38
},
"result":
{
"edges": 8899160,
"markings": 147461,
"produced_by": "LTL model checker",
"value": false
},
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 3,
"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": "X (X (X (F (((((1 <= p2)) AND ((p15 <= 0))))))))",
"processed_size": 48,
"rewrites": 38
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"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": 2,
"visible_transitions": 0
},
"processed": "F ((F ((((p73 <= 0)) OR ((1 <= p70)))) AND F (G ((X ((((p73 <= 0)) OR ((1 <= p70)))) AND (((p73 <= 0)) OR ((1 <= p70))))))))",
"processed_size": 127,
"rewrites": 38
},
"result":
{
"edges": 9,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((((p5 <= 0)) OR ((1 <= p7))))) OR (((p5 <= 0)) OR ((1 <= p7))))))",
"processed_size": 79,
"rewrites": 38
},
"result":
{
"edges": 27652,
"markings": 6150,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((G ((((1 <= p69)) AND ((p70 <= 0)))) OR (((1 <= p50)) AND ((p35 <= 0)) AND ((p15 <= 0)))))",
"processed_size": 93,
"rewrites": 38
},
"result":
{
"edges": 7,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3559
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((((1 <= p52)) AND ((p4 <= 0))))) AND (G ((((p55 <= 0)) OR ((1 <= p47)))) AND (((1 <= p23)) AND ((p34 <= 0)))))))",
"processed_size": 126,
"rewrites": 38
},
"result":
{
"edges": 182,
"markings": 76,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 7,
"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": 29868,
"runtime": 11.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G(*) OR *)) : G(F((F(G(*)) AND (G(*) AND (* AND *))))) : X(X((G(**) AND F(**)))) : X(F(**)) : X(G(*)) : X(X(X(F(*)))) : F((F(**) AND F(G((X(**) AND **))))) : X(G((G(F(**)) OR (** OR **))))"
},
"net":
{
"arcs": 1830,
"conflict_clusters": 1,
"places": 75,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 255
},
"result":
{
"preliminary_value": "no no no no no no no no ",
"value": "no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 330/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 75
lola: finding significant places
lola: 75 places, 255 transitions, 30 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: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: NOT(G ((F ((((p69 <= 0)) OR ((1 <= p70)))) AND (((p50 <= 0)) OR ((1 <= p35)) OR ((1 <= p15)))))) : G (NOT(F (G ((((G (F ((((p52 <= 0)) OR ((1 <= p4))))) OR F ((((1 <= p55)) AND ((p47 <= 0))))) OR ((p23 <= 0))) OR ((1 <= p34))))))) : X (X ((G ((((p53 <= 0)) OR ((1 <= p49)))) AND F (((1 <= p23)))))) : X (F ((((p1 <= 0)) OR ((1 <= p62))))) : X (NOT(F (((1 <= p53))))) : F (X (F (X (NOT(X (((((p2 <= 0)) OR ((1 <= p15)))))))))) : F ((F ((((p73 <= 0)) OR ((1 <= p70)))) AND F (G ((X ((((p73 <= 0)) OR ((1 <= p70)))) AND (((p73 <= 0)) OR ((1 <= p70)))))))) : X (G (((G (X (F (G (F (X ((((p5 <= 0)) OR ((1 <= p7))))))))) OR ((p5 <= 0))) OR ((1 <= p7)))))
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((((p53 <= 0)) OR ((1 <= p49)))) AND F (((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((((p53 <= 0)) OR ((1 <= p49)))) AND F (((1 <= p23))))))
lola: processed formula length: 66
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 147466 markings, 8899165 edges
lola: ========================================
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p1 <= 0)) OR ((1 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p1 <= 0)) OR ((1 <= p62)))))
lola: processed formula length: 38
lola: 38 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p53 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p53 <= 0))))
lola: processed formula length: 20
lola: 38 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: 147461 markings, 8899160 edges
lola: ========================================
lola: subprocess 3 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F (((((1 <= p2)) AND ((p15 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F (((((1 <= p2)) AND ((p15 <= 0))))))))
lola: processed formula length: 48
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 4 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((((p73 <= 0)) OR ((1 <= p70)))) AND F (G ((X ((((p73 <= 0)) OR ((1 <= p70)))) AND (((p73 <= 0)) OR ((1 <= p70))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((((p73 <= 0)) OR ((1 <= p70)))) AND F (G ((X ((((p73 <= 0)) OR ((1 <= p70)))) AND (((p73 <= 0)) OR ((1 <= p70))))))))
lola: processed formula length: 127
lola: 38 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((((p5 <= 0)) OR ((1 <= p7))))) OR (((p5 <= 0)) OR ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((((p5 <= 0)) OR ((1 <= p7))))) OR (((p5 <= 0)) OR ((1 <= p7))))))
lola: processed formula length: 79
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6150 markings, 27652 edges
lola: ========================================
lola: subprocess 6 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((((1 <= p69)) AND ((p70 <= 0)))) OR (((1 <= p50)) AND ((p35 <= 0)) AND ((p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((((1 <= p69)) AND ((p70 <= 0)))) OR (((1 <= p50)) AND ((p35 <= 0)) AND ((p15 <= 0)))))
lola: processed formula length: 93
lola: 38 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((((1 <= p52)) AND ((p4 <= 0))))) AND (G ((((p55 <= 0)) OR ((1 <= p47)))) AND (((1 <= p23)) AND ((p34 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((((1 <= p52)) AND ((p4 <= 0))))) AND (G ((((p55 <= 0)) OR ((1 <= p47)))) AND (((1 <= p23)) AND ((p34 <= 0)))))))
lola: processed formula length: 126
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 76 markings, 182 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no
lola:
preliminary result: no no no no no no no no
lola: memory consumption: 29868 KB
lola: time consumption: 11 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="Dekker-PT-015"
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 Dekker-PT-015, 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 r075-tall-162039097600381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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