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.r151-tall-162089151300257.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 PermAdmissibility-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151300257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 31K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 229K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 25 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 481K 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 PermAdmissibility-PT-02-00
FORMULA_NAME PermAdmissibility-PT-02-01
FORMULA_NAME PermAdmissibility-PT-02-02
FORMULA_NAME PermAdmissibility-PT-02-03
FORMULA_NAME PermAdmissibility-PT-02-04
FORMULA_NAME PermAdmissibility-PT-02-05
FORMULA_NAME PermAdmissibility-PT-02-06
FORMULA_NAME PermAdmissibility-PT-02-07
FORMULA_NAME PermAdmissibility-PT-02-08
FORMULA_NAME PermAdmissibility-PT-02-09
FORMULA_NAME PermAdmissibility-PT-02-10
FORMULA_NAME PermAdmissibility-PT-02-11
FORMULA_NAME PermAdmissibility-PT-02-12
FORMULA_NAME PermAdmissibility-PT-02-13
FORMULA_NAME PermAdmissibility-PT-02-14
FORMULA_NAME PermAdmissibility-PT-02-15

=== Now, execution of the tool begins

BK_START 1621015687050

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 18:08:08] [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-14 18:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 18:08:08] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2021-05-14 18:08:08] [INFO ] Transformed 168 places.
[2021-05-14 18:08:08] [INFO ] Transformed 592 transitions.
[2021-05-14 18:08:08] [INFO ] Parsed PT model containing 168 places and 592 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100001 steps, including 2133 resets, run finished after 481 ms. (steps per millisecond=207 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1]
// Phase 1: matrix 592 rows 168 cols
[2021-05-14 18:08:09] [INFO ] Computed 32 place invariants in 31 ms
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 32 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 5 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 6 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 5 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 14 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:08:09] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2021-05-14 18:08:10] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-14 18:08:10] [INFO ] Flatten gal took : 101 ms
FORMULA PermAdmissibility-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 18:08:10] [INFO ] Flatten gal took : 60 ms
[2021-05-14 18:08:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-14 18:08:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PermAdmissibility-PT-02 @ 3570 seconds

FORMULA PermAdmissibility-PT-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-02-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-02-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-02-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3553
rslt: Output for LTLCardinality @ PermAdmissibility-PT-02

{
"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": "Fri May 14 18:08:11 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"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": 1,
"visible_transitions": 0
},
"processed": "X (((p102 <= 0) U X ((1 <= p102))))",
"processed_size": 35,
"rewrites": 29
},
"result":
{
"edges": 198848,
"markings": 160517,
"produced_by": "LTL model checker",
"value": true
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p102) U X (G ((X ((1 <= p132)) OR (1 <= p102)))))",
"processed_size": 56,
"rewrites": 29
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((p157 + 1 <= p139))) AND (F (((p158 + 1 <= p128) AND (p157 + 1 <= p139))) OR (p28 <= p152)))))",
"processed_size": 107,
"rewrites": 29
},
"result":
{
"edges": 120,
"markings": 119,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (F ((p116 <= p163))) AND ((p116 <= p163) OR (p102 <= p125))))",
"processed_size": 68,
"rewrites": 29
},
"result":
{
"edges": 2896732,
"markings": 2561379,
"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": 1184
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((1 <= p80) OR (G ((p30 <= p38)) AND F ((1 <= p80)))) AND (2 <= p164)))",
"processed_size": 75,
"rewrites": 29
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1776
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((2 <= p35)))",
"processed_size": 18,
"rewrites": 29
},
"result":
{
"edges": 35,
"markings": 34,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3553
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G ((p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))",
"processed_size": 80,
"rewrites": 29
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25100,
"runtime": 17.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G(**) AND ((** U **) OR (* AND (F(*) OR G(*))))) : ((** U X(G((X(**) OR **)))) AND X((** U X(**)))) : X(F((X(F(*)) AND (F(*) OR *)))) : G((X(F(**)) AND **)) : F(G(**)) : X(((** OR (G(**) AND F(**))) AND **))"
},
"net":
{
"arcs": 3456,
"conflict_clusters": 72,
"places": 168,
"places_significant": 136,
"singleton_clusters": 0,
"transitions": 592
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "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: 760/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 592 transitions, 136 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: (G ((p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)) AND (((p101 + p103 + p104 + p106 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60) U (p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)) OR NOT((G ((p165 <= p164)) U (p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))) : (((1 <= p102) U G (X ((X ((1 <= p132)) OR (1 <= p102))))) AND X (((p102 <= 0) U X ((1 <= p102))))) : NOT(G (X ((G (X ((p139 <= p157))) OR (G (((p128 <= p158) OR (p139 <= p157))) AND (p152 + 1 <= p28)))))) : G ((F ((X (((p116 <= p163) U G ((p116 <= p163)))) U X ((p116 <= p163)))) AND ((p116 <= p163) OR (p102 <= p125)))) : G (X (F (G ((2 <= p35))))) : X ((((1 <= 0) U (G ((p30 <= p38)) U (1 <= p80))) AND (2 <= p164)))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:318
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p102) U X (G ((X ((1 <= p132)) OR (1 <= p102))))) AND X (((p102 <= 0) U X ((1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p102 <= 0) U X ((1 <= p102))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p102 <= 0) U X ((1 <= p102))))
lola: processed formula length: 35
lola: 29 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 160517 markings, 198848 edges
lola: ========================================
lola: subprocess 1 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p102) U X (G ((X ((1 <= p132)) OR (1 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p102) U X (G ((X ((1 <= p132)) OR (1 <= p102)))))
lola: processed formula length: 56
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 33 markings, 33 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((p157 + 1 <= p139))) AND (F (((p158 + 1 <= p128) AND (p157 + 1 <= p139))) OR (p28 <= p152)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((p157 + 1 <= p139))) AND (F (((p158 + 1 <= p128) AND (p157 + 1 <= p139))) OR (p28 <= p152)))))
lola: processed formula length: 107
lola: 29 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: 119 markings, 120 edges
lola: ========================================
lola: subprocess 2 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F ((p116 <= p163))) AND ((p116 <= p163) OR (p102 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F ((p116 <= p163))) AND ((p116 <= p163) OR (p102 <= p125))))
lola: processed formula length: 68
lola: 29 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: 1508819 markings, 1640313 edges, 301764 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2561379 markings, 2896732 edges
lola: ========================================
lola: subprocess 3 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p80) OR (G ((p30 <= p38)) AND F ((1 <= p80)))) AND (2 <= p164)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p80) OR (G ((p30 <= p38)) AND F ((1 <= p80)))) AND (2 <= p164)))
lola: processed formula length: 75
lola: 29 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((2 <= p35)))
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 ((2 <= p35)))
lola: processed formula length: 18
lola: 29 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: 34 markings, 35 edges
lola: ========================================
lola: subprocess 5 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)) AND (((p101 + p103 + p104 + p106 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60) U (p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)) OR ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p125 + p126 + p139 + p140) AND (F ((p164 + 1 <= p165)) OR G ((p17 + p18 + p19 + p20 + p21 + p22 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p125 + p126 + p139 + p140 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))
lola: processed formula length: 80
lola: 29 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: 33 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 25100 KB
lola: time consumption: 17 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="PermAdmissibility-PT-02"
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 PermAdmissibility-PT-02, 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 r151-tall-162089151300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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