About the Execution of ITS-LoLa for DLCround-PT-03a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15737.260 | 3600000.00 | 28799.00 | 133.80 | FTFFFTFTTTFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r180-ebro-158987900200449.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DLCround-PT-03a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900200449
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.7K Mar 30 18:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 18:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 29 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 04:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 28 04:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 148K Mar 24 05:37 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 DLCround-PT-03a-00
FORMULA_NAME DLCround-PT-03a-01
FORMULA_NAME DLCround-PT-03a-02
FORMULA_NAME DLCround-PT-03a-03
FORMULA_NAME DLCround-PT-03a-04
FORMULA_NAME DLCround-PT-03a-05
FORMULA_NAME DLCround-PT-03a-06
FORMULA_NAME DLCround-PT-03a-07
FORMULA_NAME DLCround-PT-03a-08
FORMULA_NAME DLCround-PT-03a-09
FORMULA_NAME DLCround-PT-03a-10
FORMULA_NAME DLCround-PT-03a-11
FORMULA_NAME DLCround-PT-03a-12
FORMULA_NAME DLCround-PT-03a-13
FORMULA_NAME DLCround-PT-03a-14
FORMULA_NAME DLCround-PT-03a-15
=== Now, execution of the tool begins
BK_START 1591229686075
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:14:49] [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]
[2020-06-04 00:14:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:14:49] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2020-06-04 00:14:49] [INFO ] Transformed 113 places.
[2020-06-04 00:14:49] [INFO ] Transformed 617 transitions.
[2020-06-04 00:14:49] [INFO ] Found NUPN structural information;
[2020-06-04 00:14:49] [INFO ] Parsed PT model containing 113 places and 617 transitions in 249 ms.
Ensure Unique test removed 72 transitions
Reduce redundant transitions removed 72 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 851 ms. (steps per millisecond=117 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-04 00:14:50] [INFO ] Flow matrix only has 106 transitions (discarded 439 similar events)
// Phase 1: matrix 106 rows 113 cols
[2020-06-04 00:14:50] [INFO ] Computed 52 place invariants in 15 ms
[2020-06-04 00:14:50] [INFO ] [Real]Absence check using 52 positive place invariants in 57 ms returned sat
[2020-06-04 00:14:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-04 00:14:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 40 ms returned unsat
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using 52 positive place invariants in 29 ms returned sat
[2020-06-04 00:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-06-04 00:14:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned unsat
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using 52 positive place invariants in 69 ms returned sat
[2020-06-04 00:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-06-04 00:14:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 18 ms returned unsat
[2020-06-04 00:14:51] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2020-06-04 00:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-04 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned unsat
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using 52 positive place invariants in 25 ms returned sat
[2020-06-04 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-04 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned unsat
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2020-06-04 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2020-06-04 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned unsat
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using 52 positive place invariants in 34 ms returned sat
[2020-06-04 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-04 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 11 ms returned unsat
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using 52 positive place invariants in 30 ms returned sat
[2020-06-04 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2020-06-04 00:14:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:52] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned unsat
[2020-06-04 00:14:52] [INFO ] [Real]Absence check using 52 positive place invariants in 26 ms returned sat
[2020-06-04 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-04 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned unsat
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using 52 positive place invariants in 30 ms returned sat
[2020-06-04 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2020-06-04 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 14 ms returned unsat
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2020-06-04 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-06-04 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned unsat
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2020-06-04 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-06-04 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 13 ms returned unsat
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using 52 positive place invariants in 25 ms returned sat
[2020-06-04 00:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-04 00:14:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:53] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned unsat
[2020-06-04 00:14:53] [INFO ] [Real]Absence check using 52 positive place invariants in 15 ms returned unsat
[2020-06-04 00:14:54] [INFO ] [Real]Absence check using 52 positive place invariants in 28 ms returned sat
[2020-06-04 00:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:14:54] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2020-06-04 00:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:14:54] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 17 simplifications.
[2020-06-04 00:14:54] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-04 00:14:54] [INFO ] Flatten gal took : 168 ms
FORMULA DLCround-PT-03a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:14:54] [INFO ] Applying decomposition
[2020-06-04 00:14:54] [INFO ] Flatten gal took : 49 ms
[2020-06-04 00:14:54] [INFO ] Decomposing Gal with order
[2020-06-04 00:14:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 00:14:55] [INFO ] Removed a total of 780 redundant transitions.
[2020-06-04 00:14:55] [INFO ] Flatten gal took : 166 ms
[2020-06-04 00:14:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 28 ms.
[2020-06-04 00:14:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2020-06-04 00:14:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DLCround-PT-03a @ 3570 seconds
FORMULA DLCround-PT-03a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-03a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-03a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DLCround-PT-03a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLCardinality @ DLCround-PT-03a
{
"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": "Thu Jun 4 00:14:55 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"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": "G (F (((p67 <= 0))))",
"processed_size": 20,
"rewrites": 35
},
"result":
{
"edges": 480,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p111)) AND (((p111 <= 0)) AND (((1 <= p12)) AND ((p89 <= 0)))))))",
"processed_size": 79,
"rewrites": 35
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (F ((((p34 <= 0)) OR ((1 <= p40))))) AND ((1 <= p87)))))",
"processed_size": 66,
"rewrites": 35
},
"result":
{
"edges": 3958,
"markings": 411,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"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": 3564
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p71 <= 0)) OR ((1 <= p39)))",
"processed_size": 31,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(((p71 <= 0)) OR ((1 <= p39)))",
"processed_size": 31,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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 ((((p71 <= 0)) OR ((1 <= p39)))))",
"processed_size": 39,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 3,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22752,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : G(F((* AND (* AND (* AND *))))) : (F(G(**)) AND **) : F(G((G(F(**)) AND **)))"
},
"net":
{
"arcs": 2037,
"conflict_clusters": 18,
"places": 113,
"places_significant": 61,
"singleton_clusters": 0,
"transitions": 545
},
"result":
{
"preliminary_value": "no no no no ",
"value": "no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 658/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 113
lola: finding significant places
lola: 113 places, 545 transitions, 61 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: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: X (F (X (F (G (NOT(F (X (G (((1 <= p67))))))))))) : X (NOT(F (G (((((NOT(((0 <= 0) U (0 <= 0))) OR ((p111 <= 0))) OR ((1 <= p111))) OR ((p12 <= 0))) OR ((1 <= p89))))))) : (G (X (X (X (X (F (G ((((p71 <= 0)) OR ((1 <= p39)))))))))) AND (((p71 <= 0)) OR ((1 <= p39)))) : F (G ((F (G (F ((((p34 <= 0)) OR ((1 <= p40)))))) AND ((1 <= p87)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p67 <= 0))))
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 (((p67 <= 0))))
lola: processed formula length: 20
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: 54 markings, 480 edges
lola: ========================================
lola: subprocess 1 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p111)) AND (((p111 <= 0)) AND (((1 <= p12)) AND ((p89 <= 0)))))))
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 <= p111)) AND (((p111 <= 0)) AND (((1 <= p12)) AND ((p89 <= 0)))))))
lola: processed formula length: 79
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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (F ((((p34 <= 0)) OR ((1 <= p40))))) AND ((1 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (F ((((p34 <= 0)) OR ((1 <= p40))))) AND ((1 <= p87)))))
lola: processed formula length: 66
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: 411 markings, 3958 edges
lola: ========================================
lola: subprocess 3 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((((p71 <= 0)) OR ((1 <= p39))))) AND (((p71 <= 0)) OR ((1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p71 <= 0)) OR ((1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p71 <= 0)) OR ((1 <= p39)))
lola: processed formula length: 31
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: 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: (F (G ((((p71 <= 0)) OR ((1 <= p39))))) AND (((p71 <= 0)) OR ((1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((p71 <= 0)) OR ((1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p71 <= 0)) OR ((1 <= p39)))
lola: processed formula length: 31
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: ========================================
lola: ...considering subproblem: F (G ((((p71 <= 0)) OR ((1 <= p39)))))
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 ((((p71 <= 0)) OR ((1 <= p39)))))
lola: processed formula length: 39
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no
lola:
preliminary result: no no no no
lola: memory consumption: 22752 KB
lola: time consumption: 6 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="DLCround-PT-03a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is DLCround-PT-03a, 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 r180-ebro-158987900200449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-03a.tgz
mv DLCround-PT-03a 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 ;