About the Execution of 2020-gold for DiscoveryGPU-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4278.207 | 3600000.00 | 11590.00 | 205.30 | FFTFTTTTTFFFTTFF | 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.r094-tall-162048902400141.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is DiscoveryGPU-PT-09a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902400141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 DiscoveryGPU-PT-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15
=== Now, execution of the tool begins
BK_START 1620736814029
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 12:40:15] [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-11 12:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 12:40:15] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2021-05-11 12:40:15] [INFO ] Transformed 93 places.
[2021-05-11 12:40:15] [INFO ] Transformed 127 transitions.
[2021-05-11 12:40:15] [INFO ] Found NUPN structural information;
[2021-05-11 12:40:15] [INFO ] Parsed PT model containing 93 places and 127 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1030 resets, run finished after 322 ms. (steps per millisecond=310 ) properties seen :[0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
[2021-05-11 12:40:16] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 93 cols
[2021-05-11 12:40:16] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-11 12:40:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-11 12:40:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-11 12:40:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-11 12:40:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 12:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-11 12:40:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-11 12:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:17] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-11 12:40:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 12:40:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-11 12:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 12:40:17] [INFO ] [Nat]Absence check using state equation in 34 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
[2021-05-11 12:40:17] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-11 12:40:17] [INFO ] Flatten gal took : 38 ms
FORMULA DiscoveryGPU-PT-09a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 12:40:17] [INFO ] Applying decomposition
[2021-05-11 12:40:17] [INFO ] Flatten gal took : 15 ms
[2021-05-11 12:40:17] [INFO ] Decomposing Gal with order
[2021-05-11 12:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 12:40:17] [INFO ] Removed a total of 79 redundant transitions.
[2021-05-11 12:40:17] [INFO ] Flatten gal took : 36 ms
[2021-05-11 12:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 5 ms.
[2021-05-11 12:40:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-11 12:40:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DiscoveryGPU-PT-09a @ 3570 seconds
FORMULA DiscoveryGPU-PT-09a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DiscoveryGPU-PT-09a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ DiscoveryGPU-PT-09a
{
"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": "Tue May 11 12:40:18 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 6,
"adisj": 3,
"aneg": 1,
"comp": 6,
"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": 4,
"visible_transitions": 0
},
"processed": "((X ((((p40 <= 0)) OR ((1 <= p49)))) R (((1 <= p11)) AND ((p16 <= 0)))) U X (X (G ((((p40 <= 0)) OR ((1 <= p49)))))))",
"processed_size": 119,
"rewrites": 45
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "X ((X (X (((1 <= p78)))) U (((p73 <= 0)) OR ((1 <= p35)))))",
"processed_size": 60,
"rewrites": 45
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 594
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "(((1 <= p43)) AND ((p90 <= 0)))",
"processed_size": 31,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((((p15 <= 0)) OR ((1 <= p63)))))",
"processed_size": 39,
"rewrites": 45
},
"result":
{
"edges": 1,
"markings": 2,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "X (F (((p57 <= 0))))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 1,
"markings": 2,
"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": 891
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (((1 <= p67)))",
"processed_size": 16,
"rewrites": 45
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (F (((1 <= p67))))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 47,
"markings": 47,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G ((((p70 <= 0)) OR ((1 <= p72)))))",
"processed_size": 39,
"rewrites": 45
},
"result":
{
"edges": 15,
"markings": 14,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((F (G ((((1 <= p66)) AND ((p75 <= 0))))) OR (((p55 <= 0)) OR (((1 <= p5)) OR (((1 <= p74)) AND ((p90 <= 0)))))))",
"processed_size": 115,
"rewrites": 45
},
"result":
{
"edges": 1309,
"markings": 483,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3567
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p16 <= 0))))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 130,
"markings": 104,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p16 <= 0))))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 130,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((((1 <= p32)) AND ((p58 <= 0)))) OR ((1 <= p43)))))",
"processed_size": 61,
"rewrites": 45
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 8,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 28428,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((X(**) R *) U X(X(G(**)))) : X((X(X(**)) U **)) : (G(F((G(**) OR **))) OR F(G(*))) : (X(F(**)) OR **) : F(G(**)) : X(F(*)) : G((F(G(*)) OR (** OR (** OR **)))) : (X(**) OR (G((F(**) AND (G(F(**)) OR (G(**) OR X(**))))) AND X(F(**))))"
},
"net":
{
"arcs": 408,
"conflict_clusters": 12,
"places": 93,
"places_significant": 91,
"singleton_clusters": 0,
"transitions": 127
},
"result":
{
"preliminary_value": "no yes no yes no yes no no ",
"value": "no yes no yes 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: 220/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 93
lola: finding significant places
lola: 93 places, 127 transitions, 91 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: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: (NOT((NOT(X ((((p40 <= 0)) OR ((1 <= p49))))) U (((p11 <= 0)) OR ((1 <= p16))))) U X (X (G (((1 <= 0) U (((p40 <= 0)) OR ((1 <= p49)))))))) : X ((X (X (((1 <= p78)))) U (((p73 <= 0)) OR ((1 <= p35))))) : (F (G ((F (G ((((1 <= p32)) AND ((p58 <= 0))))) OR F (((1 <= p43)))))) OR F (G (NOT(X (((1 <= p16))))))) : (((1 <= 0) U X (((1 <= 0) U F ((((p15 <= 0)) OR ((1 <= p63))))))) OR (((1 <= p43)) AND ((p90 <= 0)))) : X (G (F (G ((((p70 <= 0)) OR ((1 <= p72))))))) : F ((F (NOT(X (X ((((p82 <= 0)) OR ((1 <= p70))))))) U NOT(X (((1 <= p57)))))) : G ((((NOT(G (F ((((p66 <= 0)) OR ((1 <= p75)))))) OR ((p55 <= 0))) OR ((1 <= p5))) OR (((1 <= p74)) AND ((p90 <= 0))))) : (G (((G (F ((((p2 <= 0)) OR ((1 <= p1))))) OR G ((((p72 <= 0)) OR ((1 <= p24))))) U X (((1 <= p67))))) U X (((1 <= p67))))
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((((p40 <= 0)) OR ((1 <= p49)))) R (((1 <= p11)) AND ((p16 <= 0)))) U X (X (G ((((p40 <= 0)) OR ((1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((((p40 <= 0)) OR ((1 <= p49)))) R (((1 <= p11)) AND ((p16 <= 0)))) U X (X (G ((((p40 <= 0)) OR ((1 <= p49)))))))
lola: processed formula length: 119
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 47 markings, 47 edges
lola: subprocess 1 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (((1 <= p78)))) U (((p73 <= 0)) OR ((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (((1 <= p78)))) U (((p73 <= 0)) OR ((1 <= p35)))))
lola: processed formula length: 60
lola: 45 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p15 <= 0)) OR ((1 <= p63))))) OR (((1 <= p43)) AND ((p90 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: lola: ...considering subproblem: (((1 <= p43)) AND ((p90 <= 0)))
========================================lola:
========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p43)) AND ((p90 <= 0)))
lola: processed formula length: 31
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p15 <= 0)) OR ((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p15 <= 0)) OR ((1 <= p63)))))
lola: processed formula length: 39
lola: 45 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p57 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p57 <= 0))))
lola: processed formula length: 20
lola: 45 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p67))) OR (G ((F (((1 <= p67))) AND (G (F ((((p2 <= 0)) OR ((1 <= p1))))) OR (G ((((p72 <= 0)) OR ((1 <= p24)))) OR X (((1 <= p67))))))) AND X (F (((1 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p67)))
lola: processed formula length: 16
lola: 45 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p67))))
lola: processed formula length: 20
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p70 <= 0)) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((p70 <= 0)) OR ((1 <= p72)))))
lola: processed formula length: 39
lola: 45 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: add low 6
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: 14 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((((1 <= p66)) AND ((p75 <= 0))))) OR (((p55 <= 0)) OR (((1 <= p5)) OR (((1 <= p74)) AND ((p90 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((((1 <= p66)) AND ((p75 <= 0))))) OR (((p55 <= 0)) OR (((1 <= p5)) OR (((1 <= p74)) AND ((p90 <= 0)))))))
lola: processed formula length: 115
lola: 45 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: 483 markings, 1309 edges
lola: ========================================
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G ((((1 <= p32)) AND ((p58 <= 0)))) OR ((1 <= p43))))) OR F (G (((p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p16 <= 0))))
lola: processed formula length: 20
lola: 45 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: add low 9
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: 104 markings, 130 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 (F ((G ((((1 <= p32)) AND ((p58 <= 0)))) OR ((1 <= p43))))) OR F (G (((p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (G (((p16 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p16 <= 0))))
lola: processed formula length: 20
lola: 45 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: add low 9
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: 104 markings, 130 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G ((((1 <= p32)) AND ((p58 <= 0)))) OR ((1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((((1 <= p32)) AND ((p58 <= 0)))) OR ((1 <= p43)))))
lola: processed formula length: 61
lola: 45 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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no yes no no
lola:
preliminary result: no yes no yes no yes no no
lola: memory consumption: 28428 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r094-tall-162048902400141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a 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 ;