About the Execution of 2020-gold for Sudoku-PT-BN04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4276.512 | 3600000.00 | 20303.00 | 261.70 | FFTFFFFFFFTFFTFF | 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.r265-tall-162106800700345.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 Sudoku-PT-BN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 135K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 684K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 65K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 304K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 105K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 53K May 5 16:52 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 Sudoku-PT-BN04-00
FORMULA_NAME Sudoku-PT-BN04-01
FORMULA_NAME Sudoku-PT-BN04-02
FORMULA_NAME Sudoku-PT-BN04-03
FORMULA_NAME Sudoku-PT-BN04-04
FORMULA_NAME Sudoku-PT-BN04-05
FORMULA_NAME Sudoku-PT-BN04-06
FORMULA_NAME Sudoku-PT-BN04-07
FORMULA_NAME Sudoku-PT-BN04-08
FORMULA_NAME Sudoku-PT-BN04-09
FORMULA_NAME Sudoku-PT-BN04-10
FORMULA_NAME Sudoku-PT-BN04-11
FORMULA_NAME Sudoku-PT-BN04-12
FORMULA_NAME Sudoku-PT-BN04-13
FORMULA_NAME Sudoku-PT-BN04-14
FORMULA_NAME Sudoku-PT-BN04-15
=== Now, execution of the tool begins
BK_START 1621221251070
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 03:14:12] [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-17 03:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 03:14:12] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-17 03:14:12] [INFO ] Transformed 128 places.
[2021-05-17 03:14:12] [INFO ] Transformed 64 transitions.
[2021-05-17 03:14:12] [INFO ] Parsed PT model containing 128 places and 64 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 7173 resets, run finished after 1448 ms. (steps per millisecond=69 ) properties seen :[0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 64 rows 128 cols
[2021-05-17 03:14:14] [INFO ] Computed 64 place invariants in 6 ms
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 10 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 18 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 17 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 19 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 20 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 22 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 4 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 18 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 4 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 5 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 14 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 8 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 15 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 15 ms returned unsat
[2021-05-17 03:14:14] [INFO ] [Real]Absence check using 64 positive place invariants in 12 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
[2021-05-17 03:14:15] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-17 03:14:15] [INFO ] Flatten gal took : 67 ms
FORMULA Sudoku-PT-BN04-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 03:14:15] [INFO ] Flatten gal took : 13 ms
[2021-05-17 03:14:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-17 03:14:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Sudoku-PT-BN04 @ 3570 seconds
FORMULA Sudoku-PT-BN04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Sudoku-PT-BN04-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLCardinality @ Sudoku-PT-BN04
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 03:14:16 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 96,
"visible_transitions": 0
},
"processed": "X (X (X (X (X (G ((G ((2 <= p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)) AND (p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99))))))))",
"processed_size": 627,
"rewrites": 51
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 304,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 96,
"visible_transitions": 0
},
"processed": "X (X (((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (G (((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= 0) R (p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + 1 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99))) AND F ((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79))))))",
"processed_size": 1878,
"rewrites": 51
},
"result":
{
"edges": 2419270,
"markings": 441766,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "F ((G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0)) OR (X (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0))) R (F ((p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99 <= 0)) AND (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0)) OR G (F ((p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99 <= 0))))))))",
"processed_size": 628,
"rewrites": 51
},
"result":
{
"edges": 469,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"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
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p28 + 1 <= p5) U G ((X ((p126 + 1 <= p3)) AND (p28 + 1 <= p5)))))",
"processed_size": 70,
"rewrites": 51
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p114 <= p7)))",
"processed_size": 20,
"rewrites": 51
},
"result":
{
"edges": 57138,
"markings": 11156,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p101 <= p119)))",
"processed_size": 22,
"rewrites": 51
},
"result":
{
"edges": 58,
"markings": 50,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1188
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p80 + 1 <= p99)))",
"processed_size": 24,
"rewrites": 51
},
"result":
{
"edges": 19,
"markings": 18,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"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": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "G (F ((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)))",
"processed_size": 492,
"rewrites": 51
},
"result":
{
"edges": 4324787,
"markings": 733301,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 3561
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 96,
"visible_transitions": 0
},
"processed": "G (((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p15 + p14 + p13 + p12 + p11)))",
"processed_size": 593,
"rewrites": 51
},
"result":
{
"edges": 17,
"markings": 17,
"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": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21172,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : G(**) : X(X(X(X(X(G((G(**) AND **))))))) : X(X((** OR (G((* R *)) AND F(**))))) : F((G(*) OR (X(F(*)) R (F(*) AND (F(*) OR G(F(*))))))) : X((* U G((X(*) AND **)))) : X(G(**)) : F(G(**)) : X(F(**))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 65,
"places": 128,
"places_significant": 64,
"singleton_clusters": 0,
"transitions": 64
},
"result":
{
"preliminary_value": "no no no no no no no no no ",
"value": "no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 192/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 128
lola: finding significant places
lola: 128 places, 64 transitions, 64 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: F (G (NOT(G ((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95))))) : G (((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p15 + p14 + p13 + p12 + p11))) : X (X (X (X (G (X ((G ((2 <= p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)) AND (p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99)))))))) : X ((G (NOT((X ((1 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)) U X ((p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79))))) U X ((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79)))) : NOT(G ((F ((1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)) AND (X (G ((1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))) U (G ((1 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)) U G ((1 <= p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99))))))) : (NOT(X ((p5 <= p28))) U G (X ((NOT(X ((p3 <= p126))) AND (p28 + 1 <= p5))))) : X (G ((p114 <= p7))) : F (NOT(G (F (X (G (F (NOT(G ((p80 + 1 <= p99)))))))))) : ((0 <= 0) U ((p101 <= p119) U X ((((p24 <= p102) AND (p88 <= p119)) U (p101 <= p119)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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 (X (X (X (G ((G ((2 <= p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)) AND (p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (G ((G ((2 <= p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95)) AND (p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p... (shortened)
lola: processed formula length: 627
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 17 edges
lola: subprocess 1 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p... (shortened)
lola: processed formula length: 1878
lola: 51 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: ========================================
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: 441766 markings, 2419270 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0)) OR (X (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0))) R (F ((p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99 <= 0)) AND (F ((p112 + p113 + p11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0)) OR (X (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 0))) R (F ((p100 + p101 + p102 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p103 + p96 + p97 + p98 + p99 <= 0)) AND (F ((p112 + p113 + p11... (shortened)
lola: processed formula length: 628
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 108 markings, 469 edges
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p28 + 1 <= p5) U G ((X ((p126 + 1 <= p3)) AND (p28 + 1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p28 + 1 <= p5) U G ((X ((p126 + 1 <= p3)) AND (p28 + 1 <= p5)))))
lola: processed formula length: 70
lola: 51 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: 17 markings, 17 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p114 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p114 <= p7)))
lola: processed formula length: 20
lola: 51 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: 11156 markings, 57138 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p101 <= p119)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p101 <= p119)))
lola: processed formula length: 22
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50 markings, 58 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p80 + 1 <= p99)))
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 ((p80 + 1 <= p99)))
lola: processed formula length: 24
lola: 51 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: 18 markings, 19 edges
lola: ========================================
lola: subprocess 7 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 ... (shortened)
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 ((p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 ... (shortened)
lola: processed formula length: 492
lola: 51 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: 733301 markings, 4324787 edges
lola: ========================================
lola: subprocess 8 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p58 + p57 + p56 + p54 + p53 + p52 + p50 + p16 + p17 + p18 + p49 + p20 + p21 + p22 + p48 + p24 + p25 + p26 + p42 + p41 + p40 + p38 + p37 + p32 + p33 + p34 + p36 + p35 + p31 + p30 + p39 + p29 + p28 + p27 + p43 + p44 + p45 + p46 + p47 + p23 + p19 + p51 + p55 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p100 + p10... (shortened)
lola: processed formula length: 593
lola: 51 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: 17 markings, 17 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no
lola:
preliminary result: no no no no no no no no no
lola: memory consumption: 21172 KB
lola: time consumption: 9 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="Sudoku-PT-BN04"
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 Sudoku-PT-BN04, 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 r265-tall-162106800700345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN04.tgz
mv Sudoku-PT-BN04 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 ;