Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852700074.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 MAPK-PT-05120, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852700074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.9K Apr 8 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 8 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 19:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 19:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 6 02:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 02:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-05120-00
FORMULA_NAME MAPK-PT-05120-01
FORMULA_NAME MAPK-PT-05120-02
FORMULA_NAME MAPK-PT-05120-03
FORMULA_NAME MAPK-PT-05120-04
FORMULA_NAME MAPK-PT-05120-05
FORMULA_NAME MAPK-PT-05120-06
FORMULA_NAME MAPK-PT-05120-07
FORMULA_NAME MAPK-PT-05120-08
FORMULA_NAME MAPK-PT-05120-09
FORMULA_NAME MAPK-PT-05120-10
FORMULA_NAME MAPK-PT-05120-11
FORMULA_NAME MAPK-PT-05120-12
FORMULA_NAME MAPK-PT-05120-13
FORMULA_NAME MAPK-PT-05120-14
FORMULA_NAME MAPK-PT-05120-15

=== Now, execution of the tool begins

BK_START 1591129706409

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 20:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:28:29] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-02 20:28:29] [INFO ] Transformed 22 places.
[2020-06-02 20:28:29] [INFO ] Transformed 30 transitions.
[2020-06-02 20:28:29] [INFO ] Parsed PT model containing 22 places and 30 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 101187 steps, including 0 resets, run finished after 57 ms. (steps per millisecond=1775 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 30 rows 22 cols
[2020-06-02 20:28:29] [INFO ] Computed 7 place invariants in 3 ms
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:29] [INFO ] Added : 27 causal constraints over 7 iterations in 70 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 38 ms.
[2020-06-02 20:28:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:29] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2020-06-02 20:28:29] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 4 ms.
[2020-06-02 20:28:29] [INFO ] Added : 26 causal constraints over 6 iterations in 159 ms. Result :sat
[2020-06-02 20:28:29] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-06-02 20:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2020-06-02 20:28:30] [INFO ] Added : 26 causal constraints over 6 iterations in 88 ms. Result :sat
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2020-06-02 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 8 ms.
[2020-06-02 20:28:30] [INFO ] Added : 26 causal constraints over 6 iterations in 44 ms. Result :sat
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using 7 positive place invariants in 60 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 6 ms.
[2020-06-02 20:28:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2020-06-02 20:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 20:28:30] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2020-06-02 20:28:30] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 15 ms.
[2020-06-02 20:28:30] [INFO ] Added : 25 causal constraints over 6 iterations in 83 ms. Result :sat
[2020-06-02 20:28:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:28:31] [INFO ] Flatten gal took : 31 ms
FORMULA MAPK-PT-05120-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:28:31] [INFO ] Flatten gal took : 29 ms
[2020-06-02 20:28:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-02 20:28:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ MAPK-PT-05120 @ 3570 seconds

FORMULA MAPK-PT-05120-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA MAPK-PT-05120-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2917
rslt: Output for LTLFireability @ MAPK-PT-05120

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 20:28:31 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p4) AND (X ((F ((1 <= p18)) OR (p4 <= 0))) OR ((1 <= p18) U (p4 <= 0))))))",
"processed_size": 87,
"rewrites": 53
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p6 <= 0) OR (p9 <= 0)))",
"processed_size": 29,
"rewrites": 53
},
"result":
{
"edges": 61451,
"markings": 40966,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"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": "X ((F (((1 <= p7) AND (1 <= p8))) OR (p0 <= 0)))",
"processed_size": 48,
"rewrites": 53
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 359
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 359
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p12)))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 10244,
"markings": 10243,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p12)))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 404
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"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 (X (F (((1 <= p10) AND (1 <= p16)))))",
"processed_size": 39,
"rewrites": 53
},
"result":
{
"edges": 4,
"markings": 4,
"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": 461
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p4)))",
"processed_size": 17,
"rewrites": 53
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 538
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p12 <= 0) OR (p13 <= 0))",
"processed_size": 27,
"rewrites": 55
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 646
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 2,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((((F ((1 <= p5)) OR ((1 <= p7) AND (1 <= p8))) R ((p3 <= 0) OR (p16 <= 0))) OR ((1 <= p0) OR (G (((1 <= p7) AND (1 <= p8))) AND F ((1 <= p0))))))",
"processed_size": 149,
"rewrites": 53
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 7,
"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": 808
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((G ((F (((p3 <= 0) OR (p16 <= 0))) AND ((1 <= p3) AND (1 <= p16)))) OR G (((1 <= p3) AND (1 <= p16))))))",
"processed_size": 111,
"rewrites": 53
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"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": 1077
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((1 <= p12)) AND ((1 <= p6) AND (1 <= p7))))",
"processed_size": 50,
"rewrites": 53
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 9,
"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": 1616
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p13)))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 10244,
"markings": 10243,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 3233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p12)))",
"processed_size": 18,
"rewrites": 53
},
"result":
{
"edges": 10242,
"markings": 10242,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3360,
"runtime": 653.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : X(G((** AND (X((F(**) OR **)) OR (** U **))))) : (X((F(*) OR *)) OR G(*)) : X((** U X(G((G(*) OR (X(**) OR **)))))) : (X(G(**)) OR (G((F(*) AND F(*))) AND F(G(**)))) : X(X(F(**))) : X(G(**)) : (F(**) OR (G(F((X(**) AND *))) AND F(**))) : X((((F(**) OR *) R *) OR (** OR (G(**) AND F(**))))) : G(F(**)) : X(F((G((F(**) AND (** AND **))) OR G(**)))) : X((G(**) AND (** AND **)))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no yes unknown no no no no no no no no ",
"value": "no no yes unknown no no no no 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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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 LTLFireability.xml
lola: F (X (G ((1 <= p13)))) : X (G (((1 <= p4) AND (X ((F ((1 <= p18)) OR (p4 <= 0))) OR ((1 <= p18) U (p4 <= 0)))))) : (NOT(X ((G (((p7 <= 0) OR (p8 <= 0))) AND (1 <= p0)))) OR NOT(F (((1 <= p6) AND (1 <= p9))))) : X (((1 <= p19) U G (X (((NOT(F ((1 <= p12))) OR X (((1 <= p18) U (1 <= p18)))) OR (1 <= p4)))))) : ((NOT(F (G ((1 <= p12)))) AND NOT(X (F (G (X ((1 <= p17))))))) U X (G ((1 <= p12)))) : F (X (X (((1 <= p10) AND (1 <= p16))))) : X (G ((1 <= p4))) : (NOT(F (G ((NOT(X ((1 <= p13))) OR (p12 <= 0))))) U F (((1 <= p12) AND (1 <= p13)))) : X ((NOT(((NOT(F ((1 <= p5))) AND ((p7 <= 0) OR (p8 <= 0))) U ((1 <= p3) AND (1 <= p16)))) OR (G (((1 <= p7) AND (1 <= p8))) U (1 <= p0)))) : G ((F (((p12 <= 0) AND (1 <= p6) AND (1 <= p9))) U F ((1 <= p12)))) : F (X ((G (((F (((p3 <= 0) OR (p16 <= 0))) AND (1 <= p3)) AND (1 <= p16))) OR G (((1 <= p3) AND (1 <= p16)))))) : X (((G ((1 <= p12)) AND (1 <= p6)) AND (1 <= p7)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p4) AND (X ((F ((1 <= p18)) OR (p4 <= 0))) OR ((1 <= p18) U (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p4) AND (X ((F ((1 <= p18)) OR (p4 <= 0))) OR ((1 <= p18) U (p4 <= 0))))))
lola: processed formula length: 87
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p7) AND (1 <= p8))) OR (p0 <= 0))) OR G (((p6 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p6 <= 0) OR (p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p6 <= 0) OR (p9 <= 0)))
lola: processed formula length: 29
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 40966 markings, 61451 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p7) AND (1 <= p8))) OR (p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p7) AND (1 <= p8))) OR (p0 <= 0)))
lola: processed formula length: 48
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p19) U X (G ((G ((p12 <= 0)) OR (X ((1 <= p18)) OR (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p19) U X (G ((G ((p12 <= 0)) OR (X ((1 <= p18)) OR (1 <= p4)))))))
lola: processed formula length: 76
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 2690123 markings, 4844570 edges, 538025 markings/sec, 0 secs
lola: 5023549 markings, 9045486 edges, 466685 markings/sec, 5 secs
lola: 6594438 markings, 11874250 edges, 314178 markings/sec, 10 secs
lola: 8133315 markings, 14644786 edges, 307775 markings/sec, 15 secs
lola: 9626316 markings, 17332038 edges, 298600 markings/sec, 20 secs
lola: 11069324 markings, 19929033 edges, 288602 markings/sec, 25 secs
lola: 12596331 markings, 22678699 edges, 305401 markings/sec, 30 secs
lola: 14089346 markings, 25367345 edges, 298603 markings/sec, 35 secs
lola: 15540101 markings, 27977334 edges, 290151 markings/sec, 40 secs
lola: 16977756 markings, 30566351 edges, 287531 markings/sec, 45 secs
lola: 18387342 markings, 33104312 edges, 281917 markings/sec, 50 secs
lola: 19848976 markings, 35735336 edges, 292327 markings/sec, 55 secs
lola: 21238057 markings, 38234588 edges, 277816 markings/sec, 60 secs
lola: 22626828 markings, 40734136 edges, 277754 markings/sec, 65 secs
lola: 24016913 markings, 43238716 edges, 278017 markings/sec, 70 secs
lola: 25373449 markings, 45679909 edges, 271307 markings/sec, 75 secs
lola: 26702042 markings, 48070307 edges, 265719 markings/sec, 80 secs
lola: 28016091 markings, 50434374 edges, 262810 markings/sec, 85 secs
lola: 29341129 markings, 52822579 edges, 265008 markings/sec, 90 secs
lola: 30663374 markings, 55203170 edges, 264449 markings/sec, 95 secs
lola: 31989111 markings, 57589625 edges, 265147 markings/sec, 100 secs
lola: 33313483 markings, 59972789 edges, 264874 markings/sec, 105 secs
lola: 34663671 markings, 62402483 edges, 270038 markings/sec, 110 secs
lola: 36002611 markings, 64814083 edges, 267788 markings/sec, 115 secs
lola: 37273726 markings, 67100915 edges, 254223 markings/sec, 120 secs
lola: 38617997 markings, 69519594 edges, 268854 markings/sec, 125 secs
lola: 39964979 markings, 71946060 edges, 269396 markings/sec, 130 secs
lola: 41329348 markings, 74400630 edges, 272874 markings/sec, 135 secs
lola: 42705952 markings, 76880451 edges, 275321 markings/sec, 140 secs
lola: 44080317 markings, 79354024 edges, 274873 markings/sec, 145 secs
lola: 45456593 markings, 81831314 edges, 275255 markings/sec, 150 secs
lola: 46760382 markings, 84175888 edges, 260758 markings/sec, 155 secs
lola: 48003860 markings, 86416527 edges, 248696 markings/sec, 160 secs
lola: 49274413 markings, 88703548 edges, 254111 markings/sec, 165 secs
lola: 50619807 markings, 91126824 edges, 269079 markings/sec, 170 secs
lola: 51982458 markings, 93578962 edges, 272530 markings/sec, 175 secs
lola: 53255281 markings, 95872904 edges, 254565 markings/sec, 180 secs
lola: 54531145 markings, 98167235 edges, 255173 markings/sec, 185 secs
lola: 55801944 markings, 100454980 edges, 254160 markings/sec, 190 secs
lola: 57068959 markings, 102736301 edges, 253403 markings/sec, 195 secs
lola: 58334434 markings, 105014230 edges, 253095 markings/sec, 200 secs
lola: 59623739 markings, 107333997 edges, 257861 markings/sec, 205 secs
lola: 60963978 markings, 109747375 edges, 268048 markings/sec, 210 secs
lola: 62242641 markings, 112047574 edges, 255733 markings/sec, 215 secs
lola: 63343584 markings, 114028173 edges, 220189 markings/sec, 220 secs
lola: 64590919 markings, 116275205 edges, 249467 markings/sec, 225 secs
lola: 65835293 markings, 118517642 edges, 248875 markings/sec, 230 secs
lola: 67078771 markings, 120754633 edges, 248696 markings/sec, 235 secs
lola: 68315079 markings, 122978913 edges, 247262 markings/sec, 240 secs
lola: 69534768 markings, 125175257 edges, 243938 markings/sec, 245 secs
lola: 70725884 markings, 127317808 edges, 238223 markings/sec, 250 secs
lola: 71922489 markings, 129473834 edges, 239321 markings/sec, 255 secs
lola: 73154378 markings, 131688510 edges, 246378 markings/sec, 260 secs
lola: 75213469 markings, 136264860 edges, 411818 markings/sec, 265 secs
lola: 78091952 markings, 143382010 edges, 575697 markings/sec, 270 secs
lola: 80981961 markings, 150547292 edges, 578002 markings/sec, 275 secs
lola: 83691009 markings, 157279266 edges, 541810 markings/sec, 280 secs
lola: 85681092 markings, 162222759 edges, 398017 markings/sec, 285 secs
lola: 87507542 markings, 166788183 edges, 365290 markings/sec, 290 secs
lola: 89747457 markings, 172339453 edges, 447983 markings/sec, 295 secs
lola: 92225025 markings, 178502546 edges, 495514 markings/sec, 300 secs
lola: 94485939 markings, 184132233 edges, 452183 markings/sec, 305 secs
lola: 95952590 markings, 187783878 edges, 293330 markings/sec, 310 secs
lola: 98475329 markings, 194062473 edges, 504548 markings/sec, 315 secs
lola: 101054403 markings, 200487139 edges, 515815 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p12))) OR (G ((F ((p12 <= 0)) AND F ((p17 <= 0)))) AND F (G ((1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p12)))
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 ((1 <= p12)))
lola: processed formula length: 18
lola: 53 rewrites
lola: closed formula file LTLFireability.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 12
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: 10243 markings, 10244 edges
lola: subprocess 4 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p12)))
lola: processed formula length: 18
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 4 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 404 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p10) AND (1 <= p16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p10) AND (1 <= p16)))))
lola: processed formula length: 39
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p4)))
lola: processed formula length: 17
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p12) AND (1 <= p13))) OR (G (F ((X ((1 <= p13)) AND (1 <= p12)))) AND F (((1 <= p12) AND (1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p12) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p12 <= 0) OR (p13 <= 0))
lola: processed formula length: 27
lola: 55 rewrites
lola: closed formula file LTLFireability.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: 10242 markings, 10242 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((F ((1 <= p5)) OR ((1 <= p7) AND (1 <= p8))) R ((p3 <= 0) OR (p16 <= 0))) OR ((1 <= p0) OR (G (((1 <= p7) AND (1 <= p8))) AND F ((1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((F ((1 <= p5)) OR ((1 <= p7) AND (1 <= p8))) R ((p3 <= 0) OR (p16 <= 0))) OR ((1 <= p0) OR (G (((1 <= p7) AND (1 <= p8))) AND F ((1 <= p0))))))
lola: processed formula length: 149
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 808 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((F (((p3 <= 0) OR (p16 <= 0))) AND ((1 <= p3) AND (1 <= p16)))) OR G (((1 <= p3) AND (1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((F (((p3 <= 0) OR (p16 <= 0))) AND ((1 <= p3) AND (1 <= p16)))) OR G (((1 <= p3) AND (1 <= p16))))))
lola: processed formula length: 111
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 1077 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((1 <= p12)) AND ((1 <= p6) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((1 <= p12)) AND ((1 <= p6) AND (1 <= p7))))
lola: processed formula length: 50
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p13)))
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 ((1 <= p13)))
lola: processed formula length: 18
lola: 53 rewrites
lola: closed formula file LTLFireability.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 12
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: 10243 markings, 10244 edges
lola: ========================================
lola: subprocess 11 will run for 3233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p12)))
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 <= p12)))
lola: processed formula length: 18
lola: 53 rewrites
lola: closed formula file LTLFireability.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: 10242 markings, 10242 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (((1 <= p19) U X (G ((G ((p12 <= 0)) OR (X ((1 <= p18)) OR (1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p19) U X (G ((G ((p12 <= 0)) OR (X ((1 <= p18)) OR (1 <= p4)))))))
lola: processed formula length: 76
lola: 53 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 15 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: 3035465 markings, 5465996 edges, 607093 markings/sec, 0 secs
lola: 5625788 markings, 10130106 edges, 518065 markings/sec, 5 secs
lola: 7834273 markings, 14106059 edges, 441697 markings/sec, 10 secs
lola: 9698000 markings, 17461345 edges, 372745 markings/sec, 15 secs
lola: 11293685 markings, 20332884 edges, 319137 markings/sec, 20 secs
lola: 12903694 markings, 23232040 edges, 322002 markings/sec, 25 secs
lola: 14482311 markings, 26073088 edges, 315723 markings/sec, 30 secs
lola: 16039343 markings, 28875598 edges, 311406 markings/sec, 35 secs
lola: 17578743 markings, 31647025 edges, 307880 markings/sec, 40 secs
lola: 19093114 markings, 34372470 edges, 302874 markings/sec, 45 secs
lola: 20600207 markings, 37087643 edges, 301419 markings/sec, 50 secs
lola: 22095019 markings, 39776605 edges, 298962 markings/sec, 55 secs
lola: 23635836 markings, 42551895 edges, 308163 markings/sec, 60 secs
lola: 25163088 markings, 45300593 edges, 305450 markings/sec, 65 secs
lola: 26677009 markings, 48026186 edges, 302784 markings/sec, 70 secs
lola: 28163409 markings, 50700948 edges, 297280 markings/sec, 75 secs
lola: 29596004 markings, 53279829 edges, 286519 markings/sec, 80 secs
lola: 31018768 markings, 55842428 edges, 284553 markings/sec, 85 secs
lola: 32428517 markings, 58380056 edges, 281950 markings/sec, 90 secs
lola: 33857979 markings, 60952762 edges, 285892 markings/sec, 95 secs
lola: 35259706 markings, 63476866 edges, 280345 markings/sec, 100 secs
lola: 36628048 markings, 65941274 edges, 273668 markings/sec, 105 secs
lola: 38017200 markings, 68440855 edges, 277830 markings/sec, 110 secs
lola: 39413710 markings, 70956130 edges, 279302 markings/sec, 115 secs
lola: 40788892 markings, 73428986 edges, 275036 markings/sec, 120 secs
lola: 42144243 markings, 75868551 edges, 271070 markings/sec, 125 secs
lola: 43522872 markings, 78350534 edges, 275726 markings/sec, 130 secs
lola: 44889973 markings, 80810695 edges, 273420 markings/sec, 135 secs
lola: 46261931 markings, 83282275 edges, 274392 markings/sec, 140 secs
lola: 47619479 markings, 85722478 edges, 271510 markings/sec, 145 secs
lola: 48976268 markings, 88168165 edges, 271358 markings/sec, 150 secs
lola: 50330496 markings, 90605764 edges, 270846 markings/sec, 155 secs
lola: 51650630 markings, 92979613 edges, 264027 markings/sec, 160 secs
lola: 53002357 markings, 95415170 edges, 270345 markings/sec, 165 secs
lola: 54343762 markings, 97830512 edges, 268281 markings/sec, 170 secs
lola: 55653576 markings, 100185997 edges, 261963 markings/sec, 175 secs
lola: 56958411 markings, 102534725 edges, 260967 markings/sec, 180 secs
lola: 58300066 markings, 104952537 edges, 268331 markings/sec, 185 secs
lola: 59625000 markings, 107335258 edges, 264987 markings/sec, 190 secs
lola: 60926069 markings, 109679030 edges, 260214 markings/sec, 195 secs
lola: 62210871 markings, 111990580 edges, 256960 markings/sec, 200 secs
lola: 63507540 markings, 114323688 edges, 259334 markings/sec, 205 secs
lola: 64784553 markings, 116625920 edges, 255403 markings/sec, 210 secs
lola: 66088739 markings, 118974515 edges, 260837 markings/sec, 215 secs
lola: 67410464 markings, 121352041 edges, 264345 markings/sec, 220 secs
lola: 68654352 markings, 123589656 edges, 248778 markings/sec, 225 secs
lola: 69957063 markings, 125934237 edges, 260542 markings/sec, 230 secs
lola: 71211141 markings, 128191150 edges, 250816 markings/sec, 235 secs
lola: 72503931 markings, 130518433 edges, 258558 markings/sec, 240 secs
lola: 73789906 markings, 132833916 edges, 257195 markings/sec, 245 secs
lola: 76767839 markings, 140102695 edges, 595587 markings/sec, 250 secs
lola: 79651683 markings, 147249200 edges, 576769 markings/sec, 255 secs
lola: 82554267 markings, 154451946 edges, 580517 markings/sec, 260 secs
lola: 84805220 markings, 160049706 edges, 450191 markings/sec, 265 secs
lola: 86781143 markings, 164956564 edges, 395185 markings/sec, 270 secs
lola: 89214319 markings, 171011806 edges, 486635 markings/sec, 275 secs
lola: 91210359 markings, 175978193 edges, 399208 markings/sec, 280 secs
lola: 93651392 markings, 182054276 edges, 488207 markings/sec, 285 secs
lola: 95637546 markings, 186999552 edges, 397231 markings/sec, 290 secs
lola: 97951745 markings, 192760581 edges, 462840 markings/sec, 295 secs
lola: 99947045 markings, 197732723 edges, 399060 markings/sec, 300 secs
lola: 102009097 markings, 202864991 edges, 412410 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no yes unknown no no no no no no no no
lola:
preliminary result: no no yes unknown no no no no no no no no
lola: memory consumption: 3360 KB
lola: time consumption: 653 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="MAPK-PT-05120"
export BK_EXAMINATION="LTLFireability"
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 MAPK-PT-05120, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987852700074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-05120.tgz
mv MAPK-PT-05120 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;