About the Execution of ITS-LoLa for CSRepetitions-COL-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.840 | 3600000.00 | 22230.00 | 277.30 | FFTFFFFTTFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r182-oct2-158987914100609.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CSRepetitions-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100609
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 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 CSRepetitions-COL-02-00
FORMULA_NAME CSRepetitions-COL-02-01
FORMULA_NAME CSRepetitions-COL-02-02
FORMULA_NAME CSRepetitions-COL-02-03
FORMULA_NAME CSRepetitions-COL-02-04
FORMULA_NAME CSRepetitions-COL-02-05
FORMULA_NAME CSRepetitions-COL-02-06
FORMULA_NAME CSRepetitions-COL-02-07
FORMULA_NAME CSRepetitions-COL-02-08
FORMULA_NAME CSRepetitions-COL-02-09
FORMULA_NAME CSRepetitions-COL-02-10
FORMULA_NAME CSRepetitions-COL-02-11
FORMULA_NAME CSRepetitions-COL-02-12
FORMULA_NAME CSRepetitions-COL-02-13
FORMULA_NAME CSRepetitions-COL-02-14
FORMULA_NAME CSRepetitions-COL-02-15
=== Now, execution of the tool begins
BK_START 1591167953616
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:05:59] [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-03 07:05:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:05:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 07:06:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1092 ms
[2020-06-03 07:06:00] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,
[2020-06-03 07:06:00] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 11 ms.
[2020-06-03 07:06:00] [INFO ] Computed order based on color domains.
[2020-06-03 07:06:00] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 9 ms.
[2020-06-03 07:06:00] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5561 resets, run finished after 316 ms. (steps per millisecond=316 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 28 rows 23 cols
[2020-06-03 07:06:00] [INFO ] Computed 6 place invariants in 2 ms
[2020-06-03 07:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned unsat
[2020-06-03 07:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned unsat
[2020-06-03 07:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned unsat
[2020-06-03 07:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 07:06:00] [INFO ] [Real]Absence check using 6 positive place invariants in 30 ms returned sat
[2020-06-03 07:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned unsat
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned unsat
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned unsat
[2020-06-03 07:06:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-06-03 07:06:01] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 07:06:01] [INFO ] Flatten gal took : 38 ms
FORMULA CSRepetitions-COL-02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:06:01] [INFO ] Applying decomposition
[2020-06-03 07:06:01] [INFO ] Flatten gal took : 4 ms
[2020-06-03 07:06:01] [INFO ] Decomposing Gal with order
[2020-06-03 07:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 07:06:01] [INFO ] Removed a total of 30 redundant transitions.
[2020-06-03 07:06:01] [INFO ] Flatten gal took : 122 ms
[2020-06-03 07:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2020-06-03 07:06:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 07:06:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CSRepetitions-COL-02 @ 3570 seconds
FORMULA CSRepetitions-COL-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-02-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ CSRepetitions-COL-02
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 07:06:02 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "G ((F ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)) AND ((3 <= p1 + p2 + p3 + p4) OR X ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))",
"processed_size": 155,
"rewrites": 90
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(p0 <= p14 + p13 + p12 + p11)",
"processed_size": 29,
"rewrites": 92
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((G ((p14 + p13 + p12 + p11 <= p9 + p10)) AND (p9 + p10 + 1 <= p14 + p13 + p12 + p11)) U X ((X (G ((p14 + p13 + p12 + p11 <= p9 + p10))) OR (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))))",
"processed_size": 195,
"rewrites": 90
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((p1 + p2 + p3 + p4 + 1 <= p9 + p10) AND (p0 + 1 <= p14 + p13 + p12 + p11))",
"processed_size": 75,
"rewrites": 91
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((G ((p14 + p13 + p12 + p11 + 1 <= p0)) R X ((p0 + 1 <= p14 + p13 + p12 + p11))) OR (p14 + p13 + p12 + p11 + 1 <= p0)))",
"processed_size": 122,
"rewrites": 90
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X (F (((p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22) AND (p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22))))",
"processed_size": 140,
"rewrites": 90
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "X (X (F ((X (X ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))) OR (p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))",
"processed_size": 150,
"rewrites": 90
},
"result":
{
"edges": 252,
"markings": 121,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (F ((G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))) OR ((p9 + p10 + 1 <= p0) AND X (G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))))))))",
"processed_size": 231,
"rewrites": 90
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "F (G ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 + 1 <= p14 + p13 + p12 + p11)))",
"processed_size": 84,
"rewrites": 90
},
"result":
{
"edges": 11,
"markings": 10,
"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"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "F (G ((F ((p0 <= 0)) OR ((p0 <= 0) AND (p1 + p2 + p3 + p4 + 1 <= p14 + p13 + p12 + p11)))))",
"processed_size": 91,
"rewrites": 90
},
"result":
{
"edges": 16311,
"markings": 4190,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 1) R (p14 + p13 + p12 + p11 + 1 <= p1 + p2 + p3 + p4)) AND G ((1 <= p9 + p10)))))",
"processed_size": 96,
"rewrites": 90
},
"result":
{
"edges": 198,
"markings": 91,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 9,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "(F ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= p0)) U G ((p1 + p2 + p3 + p4 <= 1)))",
"processed_size": 90,
"rewrites": 90
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22360,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : G((F(**) AND (** OR X(**)))) : G(F(((* R *) AND G(*)))) : F(G((F(*) OR **))) : (X(G(**)) AND (F(**) AND (F(*) AND **))) : (F(**) U G(*)) : ((G(**) AND **) U X((X(G(**)) OR **))) : (G(((G(*) R X(*)) OR *)) AND (** AND **)) : X(F(**)) : X(X(F((X(X(*)) OR *)))) : X(F((G((X(**) OR **)) OR (* AND X(G((X(**) OR **)))))))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 6,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 28
},
"result":
{
"preliminary_value": "no no no no no no yes no no yes no ",
"value": "no no no no no no yes no no yes 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: 51/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: G (((0 <= 0) U X (NOT(F ((p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))) : G (((3 <= p1 + p2 + p3 + p4) U X ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))) : G (F (NOT(G ((((2 <= p0) U (p1 + p2 + p3 + p4 <= p14 + p13 + p12 + p11)) OR (((p14 + p13 + p12 + p11 <= p9 + p10) U (2 <= p0)) U F ((p9 + p10 <= 0)))))))) : X (((0 <= 0) U G ((NOT(G ((1 <= p0))) OR ((p0 <= 0) AND (p1 + p2 + p3 + p4 + 1 <= p14 + p13 + p12 + p11)))))) : (((NOT(X (NOT(G ((p0 <= p14 + p13 + p12 + p11))))) AND NOT(G (NOT(F ((1 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))) AND NOT(G ((p0 <= p14 + p13 + p12 + p11)))) AND (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 0)) : (F ((((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= p0) AND (G ((2 <= p1 + p2 + p3 + p4)) OR (p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22))) U (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= p0))) U NOT(F ((2 <= p1 + p2 + p3 + p4)))) : ((G ((p14 + p13 + p12 + p11 <= p9 + p10)) AND (p9 + p10 + 1 <= p14 + p13 + p12 + p11)) U X ((X (G ((p14 + p13 + p12 + p11 <= p9 + p10))) OR (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1)))) : ((NOT(F (((F ((p0 <= p14 + p13 + p12 + p11)) U X ((p14 + p13 + p12 + p11 <= p0))) AND (p0 <= p14 + p13 + p12 + p11)))) AND (p1 + p2 + p3 + p4 + 1 <= p9 + p10)) AND (p0 + 1 <= p14 + p13 + p12 + p11)) : X (F (((p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22) AND (p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))) : F (X ((NOT(X (X (X ((2 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22))))) OR NOT(X ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 + 1 <= p14 + p13 + p12 + p11)))))) : NOT(X (G (((p0 <= p9 + p10) U F (NOT(X ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)) AND ((3 <= p1 + p2 + p3 + p4) OR X ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)) AND ((3 <= p1 + p2 + p3 + p4) OR X ((p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))
lola: processed formula length: 155
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p0 <= p14 + p13 + p12 + p11))) AND (F ((1 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)) AND (F ((p14 + p13 + p12 + p11 + 1 <= p0)) AND (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p14 + p13 + p12 + p11 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p0 <= p14 + p13 + p12 + p11)
lola: processed formula length: 29
lola: 92 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p14 + p13 + p12 + p11 <= p9 + p10)) AND (p9 + p10 + 1 <= p14 + p13 + p12 + p11)) U X ((X (G ((p14 + p13 + p12 + p11 <= p9 + p10))) OR (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((p14 + p13 + p12 + p11 <= p9 + p10)) AND (p9 + p10 + 1 <= p14 + p13 + p12 + p11)) U X ((X (G ((p14 + p13 + p12 + p11 <= p9 + p10))) OR (p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))))
lola: processed formula length: 195
lola: 90 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((G ((p14 + p13 + p12 + p11 + 1 <= p0)) R X ((p0 + 1 <= p14 + p13 + p12 + p11))) OR (p14 + p13 + p12 + p11 + 1 <= p0))) AND ((p1 + p2 + p3 + p4 + 1 <= p9 + p10) AND (p0 + 1 <= p14 + p13 + p12 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p1 + p2 + p3 + p4 + 1 <= p9 + p10) AND (p0 + 1 <= p14 + p13 + p12 + p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p1 + p2 + p3 + p4 + 1 <= p9 + p10) AND (p0 + 1 <= p14 + p13 + p12 + p11))
lola: processed formula length: 75
lola: 91 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G ((p14 + p13 + p12 + p11 + 1 <= p0)) R X ((p0 + 1 <= p14 + p13 + p12 + p11))) OR (p14 + p13 + p12 + p11 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G ((p14 + p13 + p12 + p11 + 1 <= p0)) R X ((p0 + 1 <= p14 + p13 + p12 + p11))) OR (p14 + p13 + p12 + p11 + 1 <= p0)))
lola: processed formula length: 122
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22) AND (p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22) AND (p0 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22))))
lola: processed formula length: 140
lola: 90 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (X ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))) OR (p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (X ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= 1))) OR (p14 + p13 + p12 + p11 <= p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22)))))
lola: processed formula length: 150
lola: 90 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: 121 markings, 252 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))) OR ((p9 + p10 + 1 <= p0) AND X (G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))) OR ((p9 + p10 + 1 <= p0) AND X (G ((X (((p1 + p2 + p3 + p4 <= 0) AND (p0 + 1 <= p9 + p10))) OR (3 <= p14 + p13 + p12 + p11))))))))
lola: processed formula length: 231
lola: 90 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 + 1 <= p14 + p13 + p12 + p11)))
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 ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 + 1 <= p14 + p13 + p12 + p11)))
lola: processed formula length: 84
lola: 90 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 <= 0)) OR ((p0 <= 0) AND (p1 + p2 + p3 + p4 + 1 <= p14 + p13 + p12 + p11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 <= 0)) OR ((p0 <= 0) AND (p1 + p2 + p3 + p4 + 1 <= p14 + p13 + p12 + p11)))))
lola: processed formula length: 91
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4190 markings, 16311 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 1) R (p14 + p13 + p12 + p11 + 1 <= p1 + p2 + p3 + p4)) AND G ((1 <= p9 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p0 <= 1) R (p14 + p13 + p12 + p11 + 1 <= p1 + p2 + p3 + p4)) AND G ((1 <= p9 + p10)))))
lola: processed formula length: 96
lola: 90 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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 15
lola: add low 14
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 91 markings, 198 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= p0)) U G ((p1 + p2 + p3 + p4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((p20 + p19 + p18 + p17 + p15 + p16 + p21 + p22 <= p0)) U G ((p1 + p2 + p3 + p4 <= 1)))
lola: processed formula length: 90
lola: 90 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: 10 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes no
lola:
preliminary result: no no no no no no yes no no yes no
lola: memory consumption: 22360 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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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 r182-oct2-158987914100609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-02.tgz
mv CSRepetitions-COL-02 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 ;