About the Execution of 2020-gold for SafeBus-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4282.779 | 3600000.00 | 123140.00 | 498.30 | TFFFTFFFFTFFTFFF | 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.r208-smll-162089471100137.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SafeBus-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471100137
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 36K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 232K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 238K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Mar 28 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Mar 28 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 28 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 28 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Mar 27 11:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 27 11:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 25 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 25 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 452K 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 SafeBus-PT-06-00
FORMULA_NAME SafeBus-PT-06-01
FORMULA_NAME SafeBus-PT-06-02
FORMULA_NAME SafeBus-PT-06-03
FORMULA_NAME SafeBus-PT-06-04
FORMULA_NAME SafeBus-PT-06-05
FORMULA_NAME SafeBus-PT-06-06
FORMULA_NAME SafeBus-PT-06-07
FORMULA_NAME SafeBus-PT-06-08
FORMULA_NAME SafeBus-PT-06-09
FORMULA_NAME SafeBus-PT-06-10
FORMULA_NAME SafeBus-PT-06-11
FORMULA_NAME SafeBus-PT-06-12
FORMULA_NAME SafeBus-PT-06-13
FORMULA_NAME SafeBus-PT-06-14
FORMULA_NAME SafeBus-PT-06-15
=== Now, execution of the tool begins
BK_START 1621059993426
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 06:26:35] [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-15 06:26:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 06:26:36] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-15 06:26:36] [INFO ] Transformed 144 places.
[2021-05-15 06:26:36] [INFO ] Transformed 451 transitions.
[2021-05-15 06:26:36] [INFO ] Found NUPN structural information;
[2021-05-15 06:26:36] [INFO ] Parsed PT model containing 144 places and 451 transitions in 222 ms.
Reduce places removed 6 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 573 ms. (steps per millisecond=174 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-05-15 06:26:36] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2021-05-15 06:26:36] [INFO ] Computed 29 place invariants in 22 ms
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using 14 positive place invariants in 33 ms returned sat
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 10 ms returned sat
[2021-05-15 06:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-15 06:26:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 06:26:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned unsat
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using 14 positive and 15 generalized place invariants in 11 ms returned unsat
[2021-05-15 06:26:37] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2021-05-15 06:26:37] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-15 06:26:37] [INFO ] Flatten gal took : 120 ms
FORMULA SafeBus-PT-06-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 06:26:37] [INFO ] Applying decomposition
[2021-05-15 06:26:38] [INFO ] Flatten gal took : 66 ms
[2021-05-15 06:26:38] [INFO ] Decomposing Gal with order
[2021-05-15 06:26:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 06:26:38] [INFO ] Removed a total of 1261 redundant transitions.
[2021-05-15 06:26:38] [INFO ] Flatten gal took : 234 ms
[2021-05-15 06:26:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 24 ms.
[2021-05-15 06:26:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-15 06:26:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SafeBus-PT-06 @ 3570 seconds
FORMULA SafeBus-PT-06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SafeBus-PT-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3462
rslt: Output for LTLCardinality @ SafeBus-PT-06
{
"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": "Sat May 15 06:26:39 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((p102 + p103 + p104 + p105 + p106 + p107 <= p1)) OR (p0 <= p89 + p90 + p91 + p92 + p93 + p94)))))",
"processed_size": 110,
"rewrites": 38
},
"result":
{
"edges": 29904954,
"markings": 6816763,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 91,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 49,
"visible_transitions": 0
},
"processed": "X ((G ((X ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) R (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 + 1 <= p108 + p109 + p110 + p111 + p112 + p113))) AND (F ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) OR (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p1))))",
"processed_size": 577,
"rewrites": 38
},
"result":
{
"edges": 92,
"markings": 92,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (F (((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39) OR (G ((G ((1 <= p89 + p90 + p91 + p92 + p93 + p94)) OR (p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))) AND F ((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))))))",
"processed_size": 295,
"rewrites": 38
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 11
},
"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": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 43,
"visible_transitions": 0
},
"processed": "X (X ((((p85 + p84 + p83 + p82 + p86 + p87 <= p101) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND (((1 <= p101)) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28))))) OR (1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28))))",
"processed_size": 562,
"rewrites": 38
},
"result":
{
"edges": 98218,
"markings": 13020,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"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": 577
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p94 <= 0)) U X (X (G (((p94 <= 0) OR ((1 <= p110) AND (((p103 <= 0)) OR ((1 <= p3)))))))))",
"processed_size": 95,
"rewrites": 38
},
"result":
{
"edges": 91,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 692
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G (((p2 <= 0))) AND (((p2 <= 0)) OR ((1 <= p119)))))",
"processed_size": 57,
"rewrites": 38
},
"result":
{
"edges": 358,
"markings": 339,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 865
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p44 <= 0)) OR ((1 <= p1))))",
"processed_size": 34,
"rewrites": 38
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 865
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "G (F ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))",
"processed_size": 92,
"rewrites": 38
},
"result":
{
"edges": 110,
"markings": 110,
"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": 1154
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p3 <= 0)) OR ((1 <= p44))))",
"processed_size": 34,
"rewrites": 38
},
"result":
{
"edges": 66,
"markings": 66,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1731
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((p37 <= 0)) OR ((1 <= p13))))",
"processed_size": 35,
"rewrites": 38
},
"result":
{
"edges": 586,
"markings": 567,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3462
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3462
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(2 <= p132 + p133 + p134 + p135 + p136 + p137)",
"processed_size": 46,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(2 <= p132 + p133 + p134 + p135 + p136 + p137)",
"processed_size": 46,
"rewrites": 40
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 42
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 31,
"visible_transitions": 0
},
"processed": "G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0))",
"processed_size": 183,
"rewrites": 38
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 31580,
"runtime": 108.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G((F(**) OR **)))) : (G(**) AND F(**)) : X((G((X(**) R *)) AND (F(**) OR **))) : X(F((** OR (G((G(**) OR **)) AND F(**))))) : G(F(**)) : X(X(((** U G((X(G((F(**) AND (** OR **)))) OR G(**)))) OR **))) : (** U X(X(G(**)))) : (X(**) OR (G((G(*) AND *)) AND X(F(**)))) : G(**) : G(**)"
},
"net":
{
"arcs": 2908,
"conflict_clusters": 7,
"places": 138,
"places_significant": 109,
"singleton_clusters": 0,
"transitions": 451
},
"result":
{
"preliminary_value": "yes no no yes no no no yes no no ",
"value": "yes no no yes no no no yes 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: 589/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 138
lola: finding significant places
lola: 138 places, 451 transitions, 109 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: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p94 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: X (G ((X (F ((p102 + p103 + p104 + p105 + p106 + p107 <= p1))) OR X ((p0 <= p89 + p90 + p91 + p92 + p93 + p94))))) : (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))) : X ((G (NOT((NOT(X ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39))) U (p108 + p109 + p110 + p111 + p112 + p113 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28)))) AND (F ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) OR (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p1)))) : X (F ((G ((G ((1 <= p89 + p90 + p91 + p92 + p93 + p94)) OR ((1 <= 0) U (p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39)))) U (p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39)))) : F (G (((0 <= 0) U X (X ((X ((1 <= p108 + p109 + p110 + p111 + p112 + p113)) U (p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107))))))) : X (X ((((p85 + p84 + p83 + p82 + p86 + p87 <= p101) U G ((X (G ((((1 <= p101)) U (1 <= p132 + p133 + p134 + p135 + p136 + p137)))) OR G ((1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28))))) OR (1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28)))) : (((p94 <= 0)) U G (X (X (((p94 <= 0) OR ((1 <= p110) AND (((p103 <= 0)) OR ((1 <= p3))))))))) : (NOT(F ((NOT(G (NOT(F (((1 <= p2)))))) OR (((1 <= p2)) AND ((p119 <= 0)))))) U X ((((p44 <= 0)) OR ((1 <= p1))))) : G ((((p3 <= 0)) OR ((1 <= p44)))) : G (G ((((p37 <= 0)) OR ((1 <= p13)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((p102 + p103 + p104 + p105 + p106 + p107 <= p1)) OR (p0 <= p89 + p90 + p91 + p92 + p93 + p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((p102 + p103 + p104 + p105 + p106 + p107 <= p1)) OR (p0 <= p89 + p90 + p91 + p92 + p93 + p94)))))
lola: processed formula length: 110
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 806060 markings, 1903128 edges, 161212 markings/sec, 0 secs
lola: 1445771 markings, 3731732 edges, 127942 markings/sec, 5 secs
lola: 2004967 markings, 5486734 edges, 111839 markings/sec, 10 secs
lola: 2528644 markings, 7255802 edges, 104735 markings/sec, 15 secs
lola: 3015394 markings, 9020270 edges, 97350 markings/sec, 20 secs
lola: 3488473 markings, 10805353 edges, 94616 markings/sec, 25 secs
lola: 3972384 markings, 12712999 edges, 96782 markings/sec, 30 secs
lola: 4435195 markings, 14641833 edges, 92562 markings/sec, 35 secs
lola: 4858886 markings, 16466794 edges, 84738 markings/sec, 40 secs
lola: 5285606 markings, 18376028 edges, 85344 markings/sec, 45 secs
lola: 5715624 markings, 20361484 edges, 86004 markings/sec, 50 secs
lola: 6136654 markings, 22372309 edges, 84206 markings/sec, 55 secs
lola: 6529732 markings, 24404744 edges, 78616 markings/sec, 60 secs
lola: 6725582 markings, 26097647 edges, 39170 markings/sec, 65 secs
lola: 6772251 markings, 27472248 edges, 9334 markings/sec, 70 secs
lola: 6803709 markings, 28871905 edges, 6292 markings/sec, 75 secs
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: 6816763 markings, 29904954 edges
lola: ========================================
lola: subprocess 1 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) R (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 + 1 <= p108 + p109 + p110 + p111 + p112 + p113))) AND (F ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) OR (p4 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) R (p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 + 1 <= p108 + p109 + p110 + p111 + p112 + p113))) AND (F ((p89 + p90 + p91 + p92 + p93 + p94 <= p34 + p35 + p36 + p37 + p38 + p39)) OR (p4 +... (shortened)
lola: processed formula length: 577
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 92 markings, 92 edges
lola: ========================================
lola: subprocess 2 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39) OR (G ((G ((1 <= p89 + p90 + p91 + p92 + p93 + p94)) OR (p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))) AND F ((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39) OR (G ((G ((1 <= p89 + p90 + p91 + p92 + p93 + p94)) OR (p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))) AND F ((p85 + p84 + p83 + p82 + p86 + p87 <= p34 + p35 + p36 + p37 + p38 + p39))))))
lola: processed formula length: 295
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((((p85 + p84 + p83 + p82 + p86 + p87 <= p101) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND (((1 <= p101)) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28))))) OR (1 <= p4 + p5 + p6 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((((p85 + p84 + p83 + p82 + p86 + p87 <= p101) U G ((X (G ((F ((1 <= p132 + p133 + p134 + p135 + p136 + p137)) AND (((1 <= p101)) OR (1 <= p132 + p133 + p134 + p135 + p136 + p137))))) OR G ((1 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28))))) OR (1 <= p4 + p5 + p6 ... (shortened)
lola: processed formula length: 562
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 29 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: 13020 markings, 98218 edges
lola: ========================================
lola: subprocess 4 will run for 577 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p94 <= 0)) U X (X (G (((p94 <= 0) OR ((1 <= p110) AND (((p103 <= 0)) OR ((1 <= p3)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p94 <= 0)) U X (X (G (((p94 <= 0) OR ((1 <= p110) AND (((p103 <= 0)) OR ((1 <= p3)))))))))
lola: processed formula length: 95
lola: 38 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: 91 markings, 91 edges
lola: ========================================
lola: subprocess 5 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p44 <= 0)) OR ((1 <= p1)))) OR (G ((G (((p2 <= 0))) AND (((p2 <= 0)) OR ((1 <= p119))))) AND X (F ((((p44 <= 0)) OR ((1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p2 <= 0))) AND (((p2 <= 0)) OR ((1 <= p119)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p2 <= 0))) AND (((p2 <= 0)) OR ((1 <= p119)))))
lola: processed formula length: 57
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 339 markings, 358 edges
lola: ========================================
lola: subprocess 6 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p44 <= 0)) OR ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p44 <= 0)) OR ((1 <= p1))))
lola: processed formula length: 34
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))
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 ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))
lola: processed formula length: 92
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 110 markings, 110 edges
lola: ========================================
lola: subprocess 7 will run for 1154 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p3 <= 0)) OR ((1 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p3 <= 0)) OR ((1 <= p44))))
lola: processed formula length: 34
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 66 markings, 66 edges
lola: ========================================
lola: subprocess 8 will run for 1731 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p37 <= 0)) OR ((1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p37 <= 0)) OR ((1 <= p13))))
lola: processed formula length: 35
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 567 markings, 586 edges
lola: ========================================
lola: subprocess 9 will run for 3462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 3462 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p132 + p133 + p134 + p135 + p136 + p137)
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0)) AND F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p132 + p133 + p134 + p135 + p136 + p137 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (2 <= p132 + p133 + p134 + p135 + p136 + p137)
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p33 + p32 + p31 + p30 + p29 + p28 <= p0))
lola: processed formula length: 183
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 65 markings, 65 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no yes no no
lola:
preliminary result: yes no no yes no no no yes no no
lola: memory consumption: 31580 KB
lola: time consumption: 108 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="SafeBus-PT-06"
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 SafeBus-PT-06, 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 r208-smll-162089471100137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 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 ;