About the Execution of 2020-gold for DatabaseWithMutex-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4277.451 | 3600000.00 | 12117.00 | 252.80 | FFTFFFTFTFFFTFTF | normal |
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-162039097600361.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 DatabaseWithMutex-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 117K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 574K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 75K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 399K 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.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Mar 22 09:10 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 119K 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 DatabaseWithMutex-PT-04-00
FORMULA_NAME DatabaseWithMutex-PT-04-01
FORMULA_NAME DatabaseWithMutex-PT-04-02
FORMULA_NAME DatabaseWithMutex-PT-04-03
FORMULA_NAME DatabaseWithMutex-PT-04-04
FORMULA_NAME DatabaseWithMutex-PT-04-05
FORMULA_NAME DatabaseWithMutex-PT-04-06
FORMULA_NAME DatabaseWithMutex-PT-04-07
FORMULA_NAME DatabaseWithMutex-PT-04-08
FORMULA_NAME DatabaseWithMutex-PT-04-09
FORMULA_NAME DatabaseWithMutex-PT-04-10
FORMULA_NAME DatabaseWithMutex-PT-04-11
FORMULA_NAME DatabaseWithMutex-PT-04-12
FORMULA_NAME DatabaseWithMutex-PT-04-13
FORMULA_NAME DatabaseWithMutex-PT-04-14
FORMULA_NAME DatabaseWithMutex-PT-04-15
=== Now, execution of the tool begins
BK_START 1620572241041
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 14:57:22] [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 14:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:57:22] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-09 14:57:22] [INFO ] Transformed 140 places.
[2021-05-09 14:57:22] [INFO ] Transformed 128 transitions.
[2021-05-09 14:57:22] [INFO ] Found NUPN structural information;
[2021-05-09 14:57:22] [INFO ] Parsed PT model containing 140 places and 128 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 429 ms. (steps per millisecond=233 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0]
// Phase 1: matrix 128 rows 140 cols
[2021-05-09 14:57:23] [INFO ] Computed 28 place invariants in 8 ms
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned unsat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 7 ms returned sat
[2021-05-09 14:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-09 14:57:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:57:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned unsat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 11 ms returned sat
[2021-05-09 14:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:57:23] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-09 14:57:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:57:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 7 ms returned sat
[2021-05-09 14:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 14:57:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:57:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using 8 positive and 20 generalized place invariants in 6 ms returned sat
[2021-05-09 14:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:57:24] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 14:57:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:57:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 9 simplifications.
[2021-05-09 14:57:24] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-09 14:57:24] [INFO ] Flatten gal took : 55 ms
FORMULA DatabaseWithMutex-PT-04-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:57:24] [INFO ] Applying decomposition
[2021-05-09 14:57:24] [INFO ] Flatten gal took : 16 ms
[2021-05-09 14:57:24] [INFO ] Decomposing Gal with order
[2021-05-09 14:57:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:57:24] [INFO ] Removed a total of 94 redundant transitions.
[2021-05-09 14:57:24] [INFO ] Flatten gal took : 41 ms
[2021-05-09 14:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-09 14:57:24] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-09 14:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DatabaseWithMutex-PT-04 @ 3570 seconds
FORMULA DatabaseWithMutex-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DatabaseWithMutex-PT-04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DatabaseWithMutex-PT-04
{
"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": "Sun May 9 14:57:25 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95))",
"processed_size": 109,
"rewrites": 65
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 160,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "F ((F ((G (((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88) AND (p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= 1))) OR ((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88) AND X (((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88) AND (p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= 1)))))) OR (p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88)))",
"processed_size": 1053,
"rewrites": 65
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "X (G ((G ((p2 + p120 + p52 + p97 + 1 <= p58 + p60 + p76 + p67)) AND F ((1 <= p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98)))))",
"processed_size": 177,
"rewrites": 65
},
"result":
{
"edges": 5408,
"markings": 3692,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 0,
"U": 0,
"X": 1,
"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": "X (F ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= 1)))",
"processed_size": 111,
"rewrites": 65
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((((p101 <= 0)) OR ((1 <= p41))))) AND X ((((p101 <= 0)) OR ((1 <= p41)))))))",
"processed_size": 91,
"rewrites": 65
},
"result":
{
"edges": 111250,
"markings": 33314,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 3,
"aneg": 3,
"comp": 6,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((((((1 <= p29)) AND ((p14 <= 0))) R X (G ((((1 <= p29)) AND ((p14 <= 0)))))) AND (((1 <= p29)) AND ((p14 <= 0)))))",
"processed_size": 117,
"rewrites": 65
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"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": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "G (F ((p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69)))",
"processed_size": 210,
"rewrites": 65
},
"result":
{
"edges": 520,
"markings": 403,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "F (G ((F ((p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88))))",
"processed_size": 410,
"rewrites": 65
},
"result":
{
"edges": 134,
"markings": 130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 64,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 64,
"visible_transitions": 0
},
"processed": "G (F ((G ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 + 1 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69))))",
"processed_size": 418,
"rewrites": 65
},
"result":
{
"edges": 330,
"markings": 286,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 24028,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : (X(*) AND ((F(*) OR X(G(*))) AND X((F(**) OR **)))) : F((F((G(*) OR (* AND X(*)))) OR *)) : G(F((G(*) OR *))) : X(G((G(*) AND F(**)))) : X(F(*)) : F(G((F(**) OR **))) : X(F((F(G(**)) AND X(**)))) : X(((* R X(G(*))) AND *))"
},
"net":
{
"arcs": 416,
"conflict_clusters": 80,
"places": 140,
"places_significant": 112,
"singleton_clusters": 0,
"transitions": 128
},
"result":
{
"preliminary_value": "no no no no no yes no no no ",
"value": "no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 268/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 128 transitions, 112 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: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: G (F ((((p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69 <= 0) U (NOT(X ((p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69))) AND (p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69 + 1 <= p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96))) U ((p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= 1) U (p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69))))) : (NOT((G ((2 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69)) U X ((p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95 <= 2)))) AND X ((F ((2 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69)) OR (3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95)))) : NOT(G ((G (((p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93) U X (((p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93) OR (2 <= p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96))))) AND (p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93)))) : G (NOT(X (G (X ((F ((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99)) AND (p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69 <= p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98))))))) : G (X ((NOT(F ((p58 + p60 + p76 + p67 <= p2 + p120 + p52 + p97))) AND F ((1 <= p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98))))) : F (NOT(X ((2 <= p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99)))) : ((0 <= 0) U F (G ((F ((p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88))))) : F (X (F ((G (F (G ((((p101 <= 0)) OR ((1 <= p41)))))) AND X ((((p101 <= 0)) OR ((1 <= p41)))))))) : (NOT(X (((((p29 <= 0)) OR ((1 <= p14))) U X (F ((((p29 <= 0)) OR ((1 <= p14)))))))) AND NOT(X ((((p29 <= 0)) OR ((1 <= p14))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
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 ((3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95)) AND ((F ((p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69 <= 1)) OR X (G ((3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95)))) AND X ((F ((2 <= p5 + p108 + p109 + p110 + p118 + p131... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((3 <= p107 + p116 + p122 + p126 + p133 + p13 + p29 + p44 + p49 + p62 + p86 + p74 + p75 + p83 + p94 + p95))
lola: processed formula length: 109
lola: 65 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: 33 markings, 33 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((G (((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88) AND (p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= 1))) OR ((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((G (((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93 + 1 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88) AND (p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= 1))) OR ((p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 +... (shortened)
lola: processed formula length: 1053
lola: 65 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p2 + p120 + p52 + p97 + 1 <= p58 + p60 + p76 + p67)) AND F ((1 <= p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p2 + p120 + p52 + p97 + 1 <= p58 + p60 + p76 + p67)) AND F ((1 <= p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98)))))
lola: processed formula length: 177
lola: 65 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: 3692 markings, 5408 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= 1)))
lola: processed formula length: 111
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((((p101 <= 0)) OR ((1 <= p41))))) AND X ((((p101 <= 0)) OR ((1 <= p41)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((((p101 <= 0)) OR ((1 <= p41))))) AND X ((((p101 <= 0)) OR ((1 <= p41)))))))
lola: processed formula length: 91
lola: 65 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: 33314 markings, 111250 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((((1 <= p29)) AND ((p14 <= 0))) R X (G ((((1 <= p29)) AND ((p14 <= 0)))))) AND (((1 <= p29)) AND ((p14 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((((1 <= p29)) AND ((p14 <= 0))) R X (G ((((1 <= p29)) AND ((p14 <= 0)))))) AND (((1 <= p29)) AND ((p14 <= 0)))))
lola: processed formula length: 117
lola: 65 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p0 + p105 + p121 + p127 + p128 + p130 + p17 + p26 + p36 + p90 + p56 + p70 + p82 + p89 + p40 + p96 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p64 + p77 + p69)))
lola: processed formula length: 210
lola: 65 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: 403 markings, 520 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87 + p88)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 <= p1 + p8 + p100 + p106 + p125 + p134 + p25 + p27 + p43 + p46 + p54 + p81 + p71 + p72 + p87... (shortened)
lola: processed formula length: 410
lola: 65 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 134 edges
lola: ========================================
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 + 1 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p7 + p103 + p115 + p129 + p138 + p14 + p16 + p24 + p34 + p41 + p42 + p50 + p55 + p66 + p84 + p99 <= p4 + p114 + p136 + p11 + p19 + p20 + p33 + p35 + p39 + p51 + p61 + p65 + p73 + p80 + p85 + p93)) OR (p3 + p6 + p102 + p113 + p117 + p124 + p12 + p21 + p28 + p30 + p32 + p37 + p48 + p68 + p92 + p98 + 1 <= p5 + p108 + p109 + p110 + p118 + p131 + p135 + p139 + p10 + p18 + p38 + p47 + p63 + p... (shortened)
lola: processed formula length: 418
lola: 65 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: 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: 286 markings, 330 edges
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no
lola:
preliminary result: no no no no no yes no no no
lola: ========================================
lola: memory consumption: 24028 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="DatabaseWithMutex-PT-04"
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 DatabaseWithMutex-PT-04, 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-162039097600361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 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 '
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 ;