About the Execution of 2020-gold for PolyORBLF-PT-S06J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4377.283 | 3600000.00 | 262308.00 | 112.20 | FFFFTFFFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r170-oct2-162089287200165.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PolyORBLF-PT-S06J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287200165
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 313K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.4M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 162K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Mar 27 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 27 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 25 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 19M 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 PolyORBLF-PT-S06J04T08-00
FORMULA_NAME PolyORBLF-PT-S06J04T08-01
FORMULA_NAME PolyORBLF-PT-S06J04T08-02
FORMULA_NAME PolyORBLF-PT-S06J04T08-03
FORMULA_NAME PolyORBLF-PT-S06J04T08-04
FORMULA_NAME PolyORBLF-PT-S06J04T08-05
FORMULA_NAME PolyORBLF-PT-S06J04T08-06
FORMULA_NAME PolyORBLF-PT-S06J04T08-07
FORMULA_NAME PolyORBLF-PT-S06J04T08-08
FORMULA_NAME PolyORBLF-PT-S06J04T08-09
FORMULA_NAME PolyORBLF-PT-S06J04T08-10
FORMULA_NAME PolyORBLF-PT-S06J04T08-11
FORMULA_NAME PolyORBLF-PT-S06J04T08-12
FORMULA_NAME PolyORBLF-PT-S06J04T08-13
FORMULA_NAME PolyORBLF-PT-S06J04T08-14
FORMULA_NAME PolyORBLF-PT-S06J04T08-15
=== Now, execution of the tool begins
BK_START 1621383535349
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 00:18:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 00:18:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:18:57] [INFO ] Load time of PNML (sax parser for PT used): 563 ms
[2021-05-19 00:18:57] [INFO ] Transformed 810 places.
[2021-05-19 00:18:57] [INFO ] Transformed 14014 transitions.
[2021-05-19 00:18:57] [INFO ] Parsed PT model containing 810 places and 14014 transitions in 718 ms.
Ensure Unique test removed 10760 transitions
Reduce redundant transitions removed 10760 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 132 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 645 resets, run finished after 881 ms. (steps per millisecond=113 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1]
[2021-05-19 00:18:58] [INFO ] Flow matrix only has 3206 transitions (discarded 48 similar events)
// Phase 1: matrix 3206 rows 810 cols
[2021-05-19 00:18:58] [INFO ] Computed 58 place invariants in 145 ms
[2021-05-19 00:18:58] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2021-05-19 00:18:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2021-05-19 00:18:58] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2021-05-19 00:18:58] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 55 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 48 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 54 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 25 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 49 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 28 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 48 ms returned unsat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2021-05-19 00:18:59] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 51 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 50 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 53 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 54 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 48 ms returned unsat
[2021-05-19 00:19:00] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned unsat
Successfully simplified 17 atomic propositions for a total of 20 simplifications.
[2021-05-19 00:19:00] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-19 00:19:01] [INFO ] Flatten gal took : 291 ms
FORMULA PolyORBLF-PT-S06J04T08-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T08-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:19:01] [INFO ] Flatten gal took : 165 ms
[2021-05-19 00:19:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 00:19:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J04T08 @ 3570 seconds
check_solution: Variable C27 = -0.718855381012 is below its lower bound 0
check_solution: Variable C28 = -0.354507201605 is below its lower bound 0
check_solution: Variable C435 = -0.423940896988 is below its lower bound 0
check_solution: Variable C436 = -0.3109751081 is below its lower bound 0
check_solution: Variable C844 = -0.098179280926 is below its lower bound 0
check_solution: Variable C2068 = -0.0467066470289 is below its lower bound 0
check_solution: Variable C2883 = -0.915842533112 is below its lower bound 0
check_solution: Variable C2884 = -0.588373189693 is below its lower bound 0
check_solution: Variable C3699 = -0.307448863983 is below its lower bound 0
check_solution: Constraint R17 = 8.18878175939e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 7.92836)
check_solution: Variable C755 = -0.216247081757 is below its lower bound 0
check_solution: Variable C1163 = -0.0933343172074 is below its lower bound 0
check_solution: Variable C1164 = -0.0178365857515 is below its lower bound 0
check_solution: Variable C2795 = -0.0651364922524 is below its lower bound 0
check_solution: Variable C3203 = -0.0336164236069 is below its lower bound 0
check_solution: Variable C4019 = -0.168387413025 is below its lower bound 0
check_solution: Variable C4020 = -0.240878645828 is below its lower bound 0
check_solution: Constraint R17 = 9.50441914939e-311 is above its equality of -1
check_solution: Constraint R32 = 4.59624288398e-311 is above its equality of -1
check_solution: Constraint R79 = 6.52301506382e-311 is above its equality of -1
Seriously low accuracy found ||*|| = 10 (rel. error 483.4)
FORMULA PolyORBLF-PT-S06J04T08-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T08-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3326
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J04T08
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 00:19:01 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (X (F ((p422 + p496 + p596 + p686 + p19 <= p222 + p434 + p438 + p516 + p688 + p708 + p788 + p799))))",
"processed_size": 102,
"rewrites": 35
},
"result":
{
"edges": 148,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "X (G ((p188 + p233 + p315 + p368 + p415 + p546 + p622 + p72 <= p230 + p300 + p328 + p584 + p652 + p67)))",
"processed_size": 104,
"rewrites": 35
},
"result":
{
"edges": 148,
"markings": 148,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 480
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((((p296 <= p663) U (p746 <= p198)) U (3 <= p152)))",
"processed_size": 53,
"rewrites": 35
},
"result":
{
"edges": 43291,
"markings": 34720,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 561
},
"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 ((p416 <= p750)))",
"processed_size": 22,
"rewrites": 35
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 673
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 673
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p93 <= 0) OR (p107 + 1 <= p415))",
"processed_size": 35,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p93))",
"processed_size": 14,
"rewrites": 35
},
"result":
{
"edges": 94,
"markings": 94,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1122
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p298 <= p732) U (p415 <= p107)))",
"processed_size": 37,
"rewrites": 35
},
"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": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p140 + p176 + p198 + p444 + p520 + p572 + p45 + p712)))",
"processed_size": 67,
"rewrites": 35
},
"result":
{
"edges": 381207,
"markings": 301555,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1116
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((G (F ((1 <= p21))) OR G (F ((1 <= p21)))))",
"processed_size": 46,
"rewrites": 35
},
"result":
{
"edges": 94,
"markings": 94,
"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": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1674
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G ((p72 + 1 <= p149)) OR ((p722 + 1 <= p126) AND (p72 + 1 <= p149)))))",
"processed_size": 77,
"rewrites": 35
},
"result":
{
"edges": 183,
"markings": 183,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 76,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 74,
"visible_transitions": 0
},
"processed": "G ((G ((F (G ((F ((p737 <= p474)) AND ((1 <= p458) OR (p737 <= p474))))) OR (1 <= p46))) OR (p143 + p163 + p166 + p205 + p216 + p254 + p265 + p291 + p350 + p379 + p380 + p406 + p430 + p482 + p553 + p560 + p629 + p644 + p670 + p693 + p743 + p747 + p751 + p785 + p786 + p40 + p31 + p780 + p74 + p86 <= p101 + p154 + p177 + p199 + p206 + p249 + p264 + p283 + p319 + p345 + p346 + p356 + p376 + p381 + p417 + p419 + p443 + p487 + p509 + p517 + p525 + p549 + p558 + p561 + p597 + p600 + p619 + p650 + p658 + p671 + p678 + p683 + p701 + p56 + p768 + p793 + p800 + p807 + p79 + p89)))",
"processed_size": 577,
"rewrites": 35
},
"result":
{
"edges": 370211,
"markings": 168453,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 122932,
"runtime": 244.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : G((G((F(G((F(**) AND (** OR **)))) OR **)) OR **)) : X(X(F(**))) : X(G(*)) : X(((** U **) U **)) : X(F(**)) : G((G(F(**)) OR G(F(**)))) : G(F((G(*) OR (* AND *)))) : (X((** U **)) OR (G(**) AND **))"
},
"net":
{
"arcs": 19908,
"conflict_clusters": 307,
"places": 810,
"places_significant": 752,
"singleton_clusters": 0,
"transitions": 3254
},
"result":
{
"preliminary_value": "no no no no no yes no no yes ",
"value": "no no no no no yes no no yes "
},
"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: 4064/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25920
lola: finding significant places
lola: 810 places, 3254 transitions, 752 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (F (X (F (((0 <= 0) U F ((1 <= p140 + p176 + p198 + p444 + p520 + p572 + p45 + p712))))))) : G ((G ((F (G (((1 <= p458) U (p737 <= p474)))) OR (1 <= p46))) OR (p143 + p163 + p166 + p205 + p216 + p254 + p265 + p291 + p350 + p379 + p380 + p406 + p430 + p482 + p553 + p560 + p629 + p644 + p670 + p693 + p743 + p747 + p751 + p785 + p786 + p40 + p31 + p780 + p74 + p86 <= p101 + p154 + p177 + p199 + p206 + p249 + p264 + p283 + p319 + p345 + p346 + p356 + p376 + p381 + p417 + p419 + p443 + p487 + p509 + p517 + p525 + p549 + p558 + p561 + p597 + p600 + p619 + p650 + p658 + p671 + p678 + p683 + p701 + p56 + p768 + p793 + p800 + p807 + p79 + p89))) : F (X (X ((p422 + p496 + p596 + p686 + p19 <= p222 + p434 + p438 + p516 + p688 + p708 + p788 + p799)))) : NOT(X (F (((0 <= 0) U (p230 + p300 + p328 + p584 + p652 + p67 + 1 <= p188 + p233 + p315 + p368 + p415 + p546 + p622 + p72))))) : X ((((p296 <= p663) U (p746 <= p198)) U (3 <= p152))) : X (F ((p416 <= p750))) : G ((X (F (X (G (F ((1 <= p21)))))) OR X (G (F ((1 <= p21)))))) : X (G (NOT(X (G (((p126 <= p722) U (p149 <= p72))))))) : (X (((p298 <= p732) U (p415 <= p107))) OR (G ((1 <= p93)) AND ((p93 <= 0) OR (p107 + 1 <= p415))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p422 + p496 + p596 + p686 + p19 <= p222 + p434 + p438 + p516 + p688 + p708 + p788 + p799))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p422 + p496 + p596 + p686 + p19 <= p222 + p434 + p438 + p516 + p688 + p708 + p788 + p799))))
lola: processed formula length: 102
lola: 35 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: 148 markings, 148 edges
lola: ========================================
lola: subprocess 1 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p188 + p233 + p315 + p368 + p415 + p546 + p622 + p72 <= p230 + p300 + p328 + p584 + p652 + p67)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p188 + p233 + p315 + p368 + p415 + p546 + p622 + p72 <= p230 + p300 + p328 + p584 + p652 + p67)))
lola: processed formula length: 104
lola: 35 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: 148 markings, 148 edges
lola: ========================================
lola: subprocess 2 will run for 480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p296 <= p663) U (p746 <= p198)) U (3 <= p152)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p296 <= p663) U (p746 <= p198)) U (3 <= p152)))
lola: processed formula length: 53
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 34720 markings, 43291 edges
lola: ========================================
lola: subprocess 3 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p416 <= p750)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p416 <= p750)))
lola: processed formula length: 22
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p298 <= p732) U (p415 <= p107))) OR (G ((1 <= p93)) AND ((p93 <= 0) OR (p107 + 1 <= p415))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p93 <= 0) OR (p107 + 1 <= p415))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p93 <= 0) OR (p107 + 1 <= p415))
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p93))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p93))
lola: processed formula length: 14
lola: 35 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: 94 markings, 94 edges
lola: ========================================
lola: subprocess 6 will run for 1122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p298 <= p732) U (p415 <= p107)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p298 <= p732) U (p415 <= p107)))
lola: processed formula length: 37
lola: 35 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 5 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p140 + p176 + p198 + p444 + p520 + p572 + p45 + p712)))
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 ((1 <= p140 + p176 + p198 + p444 + p520 + p572 + p45 + p712)))
lola: processed formula length: 67
lola: 35 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: 86009 markings, 105577 edges, 17202 markings/sec, 0 secs
lola: 183634 markings, 227566 edges, 19525 markings/sec, 5 secs
lola: 272926 markings, 341634 edges, 17858 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 301555 markings, 381207 edges
lola: ========================================
lola: subprocess 6 will run for 1116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((1 <= p21))) OR G (F ((1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((1 <= p21))) OR G (F ((1 <= p21)))))
lola: processed formula length: 46
lola: 35 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: 94 markings, 94 edges
lola: subprocess 7 will run for 1674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p72 + 1 <= p149)) OR ((p722 + 1 <= p126) AND (p72 + 1 <= p149)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p72 + 1 <= p149)) OR ((p722 + 1 <= p126) AND (p72 + 1 <= p149)))))
lola: processed formula length: 77
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 183 markings, 183 edges
lola: ========================================
lola: subprocess 8 will run for 3349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((F (G ((F ((p737 <= p474)) AND ((1 <= p458) OR (p737 <= p474))))) OR (1 <= p46))) OR (p143 + p163 + p166 + p205 + p216 + p254 + p265 + p291 + p350 + p379 + p380 + p406 + p430 + p482 + p553 + p560 + p629 + p644 + p670 + p693 + p743 + p747 + p751 + p785 + p786 + p40 + p31 + p780 + p74 + p86 <= p101 + p154 + p177 + p199 + p206 + p249 + p264 + p283 + p319 + p345 + p346 + p356 + p376 + p381 + p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((F (G ((F ((p737 <= p474)) AND ((1 <= p458) OR (p737 <= p474))))) OR (1 <= p46))) OR (p143 + p163 + p166 + p205 + p216 + p254 + p265 + p291 + p350 + p379 + p380 + p406 + p430 + p482 + p553 + p560 + p629 + p644 + p670 + p693 + p743 + p747 + p751 + p785 + p786 + p40 + p31 + p780 + p74 + p86 <= p101 + p154 + p177 + p199 + p206 + p249 + p264 + p283 + p319 + p345 + p346 + p356 + p376 + p381 + p4... (shortened)
lola: processed formula length: 577
lola: 35 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: 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: 36133 markings, 79671 edges, 7227 markings/sec, 0 secs
lola: 69761 markings, 157524 edges, 6726 markings/sec, 5 secs
lola: 104016 markings, 236072 edges, 6851 markings/sec, 10 secs
lola: 140185 markings, 317313 edges, 7234 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 168453 markings, 370211 edges
lola: RESULT
lola:
SUMMARY: no no no no no yes no no yes
lola:
preliminary result: no no no no no yes no no yes
lola: ========================================
lola: memory consumption: 122932 KB
lola: time consumption: 244 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="PolyORBLF-PT-S06J04T08"
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 PolyORBLF-PT-S06J04T08, 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 r170-oct2-162089287200165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T08.tgz
mv PolyORBLF-PT-S06J04T08 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 ;