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.r322-tall-162132128200289.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 UtilityControlRoom-PT-Z2T4N08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128200289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 92K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 408K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 146K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 583K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 12 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 12 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 12 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 12 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 9.4K May 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 11 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 11 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 8 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 93K May 12 08:13 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 UtilityControlRoom-PT-Z2T4N08-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N08-15

=== Now, execution of the tool begins

BK_START 1621452547748

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 19:29:09] [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-19 19:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:29:09] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-19 19:29:09] [INFO ] Transformed 140 places.
[2021-05-19 19:29:09] [INFO ] Transformed 216 transitions.
[2021-05-19 19:29:09] [INFO ] Parsed PT model containing 140 places and 216 transitions in 89 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 509 ms. (steps per millisecond=196 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 184 rows 140 cols
[2021-05-19 19:29:10] [INFO ] Computed 19 place invariants in 9 ms
[2021-05-19 19:29:10] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2021-05-19 19:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 19:29:10] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-19 19:29:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 19:29:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2021-05-19 19:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 19:29:10] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-19 19:29:10] [INFO ] Computed and/alt/rep : 176/392/176 causal constraints in 25 ms.
[2021-05-19 19:29:11] [INFO ] Added : 176 causal constraints over 36 iterations in 648 ms. Result :sat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned unsat
[2021-05-19 19:29:11] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
[2021-05-19 19:29:11] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 19:29:11] [INFO ] Flatten gal took : 50 ms
FORMULA UtilityControlRoom-PT-Z2T4N08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N08-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:29:11] [INFO ] Flatten gal took : 16 ms
[2021-05-19 19:29:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 19:29:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ UtilityControlRoom-PT-Z2T4N08 @ 3570 seconds

FORMULA UtilityControlRoom-PT-Z2T4N08-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA UtilityControlRoom-PT-Z2T4N08-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ UtilityControlRoom-PT-Z2T4N08

{
"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": "Wed May 19 19:29:12 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 114,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 98,
"visible_transitions": 0
},
"processed": "X ((X ((2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89)) AND (G ((G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)) OR (2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89))) OR F (((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p0 + p1))))))",
"processed_size": 764,
"rewrites": 34
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((3 <= p98) U X (F ((p0 <= p98))))",
"processed_size": 34,
"rewrites": 34
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((((p102 <= p21) U (2 <= p99)) OR (F ((2 <= p99)) AND F (G ((F ((p102 <= p90)) AND (X (X ((p55 <= p16))) OR (p102 <= p90))))))))",
"processed_size": 130,
"rewrites": 34
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 594
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p37 <= p21)))",
"processed_size": 20,
"rewrites": 34
},
"result":
{
"edges": 4979,
"markings": 3157,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F (G (((p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= 0))))",
"processed_size": 267,
"rewrites": 34
},
"result":
{
"edges": 67,
"markings": 57,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((p98 <= 0))) OR (G ((p98 <= 0)) AND F ((p98 <= 0))))))",
"processed_size": 67,
"rewrites": 34
},
"result":
{
"edges": 50,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 5,
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((F ((F ((3 <= p98)) OR (F ((3 <= p98)) AND F (G ((3 <= p98)))))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) U (3 <= p98))))",
"processed_size": 140,
"rewrites": 34
},
"result":
{
"edges": 72,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)",
"processed_size": 160,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "F (G ((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))",
"processed_size": 168,
"rewrites": 34
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "(p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 0)",
"processed_size": 100,
"rewrites": 36
},
"result":
{
"edges": 1032,
"markings": 264,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 64
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22064,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F((F(**) OR (F(**) AND F(G(**))))) OR (** U **))) : (G(**) OR F(**)) : G(F((G(F(*)) OR (G(*) AND F(*))))) : (F(G(**)) AND **) : X((X(**) AND (G((G(**) OR **)) OR F(**)))) : F(G(**)) : F(G(*)) : (** U X(F(**))) : F(((** U **) OR (F(**) AND F(G((F(**) AND (X(X(**)) OR **)))))))"
},
"net":
{
"arcs": 552,
"conflict_clusters": 82,
"places": 140,
"places_significant": 121,
"singleton_clusters": 0,
"transitions": 184
},
"result":
{
"preliminary_value": "no yes no no no no no yes no ",
"value": "no yes no no no no no yes 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: 324/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 184 transitions, 121 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 ((F ((X (F (G ((3 <= p98)))) U F ((3 <= p98)))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) U (3 <= p98)))) : (G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 0) AND (p99 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))) OR ((0 <= 0) U (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : NOT(F (G ((G (F (G ((1 <= p98)))) AND (F ((1 <= p98)) OR G ((1 <= p98))))))) : (X (F (X (G ((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97))))) AND (p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)) : X ((X ((2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89)) AND (G ((G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)) OR (2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89))) OR F (((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p0 + p1)))))) : F (G (((p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= 0)))) : G (F (G (NOT(X (F ((p21 + 1 <= p37))))))) : ((3 <= p98) U F (X (F ((p0 <= p98))))) : F ((F (G ((X (X ((p55 <= p16))) U (p102 <= p90)))) U ((p102 <= p21) U (2 <= p99))))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89)) AND (G ((G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((2 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89)) AND (G ((G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p... (shortened)
lola: processed formula length: 764
lola: 34 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p98) U X (F ((p0 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p98) U X (F ((p0 <= p98))))
lola: processed formula length: 34
lola: 34 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p102 <= p21) U (2 <= p99)) OR (F ((2 <= p99)) AND F (G ((F ((p102 <= p90)) AND (X (X ((p55 <= p16))) OR (p102 <= p90))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p102 <= p21) U (2 <= p99)) OR (F ((2 <= p99)) AND F (G ((F ((p102 <= p90)) AND (X (X ((p55 <= p16))) OR (p102 <= p90))))))))
lola: processed formula length: 130
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p37 <= p21)))
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 ((p37 <= p21)))
lola: processed formula length: 20
lola: 34 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: 3157 markings, 4979 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= 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 (((p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p89 <= 0))))
lola: processed formula length: 267
lola: 34 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: 57 markings, 67 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((p98 <= 0))) OR (G ((p98 <= 0)) AND F ((p98 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((p98 <= 0))) OR (G ((p98 <= 0)) AND F ((p98 <= 0))))))
lola: processed formula length: 67
lola: 34 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: 50 markings, 50 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F ((3 <= p98)) OR (F ((3 <= p98)) AND F (G ((3 <= p98)))))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) U (3 <= p98))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F ((3 <= p98)) OR (F ((3 <= p98)) AND F (G ((3 <= p98)))))) OR ((1 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97) U (3 <= p98))))
lola: processed formula length: 140
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 68 markings, 72 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97))) AND (p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)
lola: processed formula length: 160
lola: 34 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 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))
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 ((p124 + p126 + p128 + p130 + p132 + p134 + p136 + p138 + p139 + p137 + p135 + p133 + p131 + p129 + p127 + p125 <= p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97)))
lola: processed formula length: 168
lola: 34 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: 10 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 0) AND (p99 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))) OR F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 0)
lola: processed formula length: 100
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 264 markings, 1032 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no yes no
lola:
preliminary result: no yes no no no no no yes no
lola: memory consumption: 22064 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="UtilityControlRoom-PT-Z2T4N08"
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 UtilityControlRoom-PT-Z2T4N08, 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 r322-tall-162132128200289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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