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.r186-oct2-158987938700210.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 RobotManipulation-PT-01000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700210
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.2K Apr 12 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 11 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 9 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 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 RobotManipulation-PT-01000-00
FORMULA_NAME RobotManipulation-PT-01000-01
FORMULA_NAME RobotManipulation-PT-01000-02
FORMULA_NAME RobotManipulation-PT-01000-03
FORMULA_NAME RobotManipulation-PT-01000-04
FORMULA_NAME RobotManipulation-PT-01000-05
FORMULA_NAME RobotManipulation-PT-01000-06
FORMULA_NAME RobotManipulation-PT-01000-07
FORMULA_NAME RobotManipulation-PT-01000-08
FORMULA_NAME RobotManipulation-PT-01000-09
FORMULA_NAME RobotManipulation-PT-01000-10
FORMULA_NAME RobotManipulation-PT-01000-11
FORMULA_NAME RobotManipulation-PT-01000-12
FORMULA_NAME RobotManipulation-PT-01000-13
FORMULA_NAME RobotManipulation-PT-01000-14
FORMULA_NAME RobotManipulation-PT-01000-15

=== Now, execution of the tool begins

BK_START 1591230465605

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 00:27:47] [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-04 00:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 00:27:48] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2020-06-04 00:27:48] [INFO ] Transformed 15 places.
[2020-06-04 00:27:48] [INFO ] Transformed 11 transitions.
[2020-06-04 00:27:48] [INFO ] Parsed PT model containing 15 places and 11 transitions in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100075 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=2042 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 11 rows 15 cols
[2020-06-04 00:27:48] [INFO ] Computed 6 place invariants in 4 ms
[2020-06-04 00:27:48] [INFO ] [Real]Absence check using 3 positive place invariants in 41 ms returned sat
[2020-06-04 00:27:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 31 ms returned sat
[2020-06-04 00:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 00:27:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-04 00:27:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2020-06-04 00:27:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 00:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2020-06-04 00:27:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 00:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 00:27:48] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-04 00:27:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 5 ms.
[2020-06-04 00:27:48] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
[2020-06-04 00:27:48] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-04 00:27:48] [INFO ] Flatten gal took : 20 ms
FORMULA RobotManipulation-PT-01000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 00:27:48] [INFO ] Flatten gal took : 2 ms
[2020-06-04 00:27:48] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-04 00:27:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RobotManipulation-PT-01000 @ 3570 seconds

FORMULA RobotManipulation-PT-01000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-01000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2993
rslt: Output for LTLFireability @ RobotManipulation-PT-01000

{
"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": "Thu Jun 4 00:27:49 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G (((1 <= p3) AND (1 <= p5))))",
"processed_size": 33,
"rewrites": 75
},
"result":
{
"edges": 2006,
"markings": 2006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X (X (((((p3 <= 0) OR (p5 <= 0)) AND (F (G ((p10 <= 0))) OR G (((p3 <= 0) OR (p5 <= 0))))) R X ((p7 <= 0))))) OR (p10 <= 0))))",
"processed_size": 135,
"rewrites": 75
},
"result":
{
"edges": 46054,
"markings": 32048,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 54
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p10) OR (G (F (((1 <= p2) AND (1 <= p9)))) AND F ((1 <= p10))))))",
"processed_size": 78,
"rewrites": 75
},
"result":
{
"edges": 2006,
"markings": 2006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p13) AND (1 <= p14))",
"processed_size": 27,
"rewrites": 75
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 655
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p10 <= 0)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 18008,
"markings": 18007,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((G (((1 <= p13) AND (1 <= p14))) OR (1 <= p10)))",
"processed_size": 51,
"rewrites": 75
},
"result":
{
"edges": 10005,
"markings": 10005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 818
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p10 <= 0)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 18008,
"markings": 18007,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"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": 1091
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 9,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 9,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND ((1 <= p14) AND (F (((p7 <= 0) OR (p11 <= 0))) OR G ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND (1 <= p14))))))))))",
"processed_size": 257,
"rewrites": 75
},
"result":
{
"edges": 2006,
"markings": 2006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 1637
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p3 <= 0) OR (p5 <= 0))))",
"processed_size": 33,
"rewrites": 75
},
"result":
{
"edges": 2008,
"markings": 2007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((G (((1 <= p1) AND (1 <= p5))) AND (p12 <= 0)) U G ((G (F (((1 <= p3) AND (1 <= p5)))) OR (1 <= p8))))",
"processed_size": 103,
"rewrites": 75
},
"result":
{
"edges": 2010,
"markings": 2010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 9,
"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": 3428,
"runtime": 577.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : F(G((X(X(((* AND (F(G(*)) OR G(*))) R X(*)))) OR **))) : F(G(*)) : X((G((F(**) OR **)) AND **)) : X(F((** OR (G(F(**)) AND F(**))))) : ((F(**) AND (X(*) OR **)) OR (G((G(**) OR **)) AND F((F(**) AND (X(*) OR **))))) : X(X(F((((** U **) AND **) OR (G(**) AND F(((** U **) AND **))))))) : (X(F((G(*) OR (* AND *)))) AND F(**)) : X(X((F((G(**) AND (* AND *))) AND (* AND (* AND (F(*) OR G((F((G(**) AND (* AND *))) AND (* AND *))))))))) : ((G(**) AND **) U G((G(F(**)) OR **)))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no unknown no no no no no no ",
"value": "no no no unknown 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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: G (X (((1 <= p3) AND (1 <= p5)))) : F (G ((NOT(X (X (((G (F ((1 <= p10))) U ((1 <= p3) AND (1 <= p5))) U X ((1 <= p7)))))) OR (p10 <= 0)))) : X (X (F (NOT(F (((1 <= p3) AND (1 <= p5))))))) : X ((G ((F (((1 <= p7) AND (1 <= p11))) OR ((1 <= p2) AND (1 <= p9)))) AND ((p8 <= 0) OR (p6 <= 0)))) : X (F ((F (G (F (((1 <= p2) AND (1 <= p9))))) U (1 <= p10)))) : (G ((G (((1 <= p13) AND (1 <= p14))) OR (1 <= p10))) U (F ((1 <= p10)) AND (NOT(X ((1 <= p6))) OR ((1 <= p13) AND (1 <= p14))))) : X (F (X ((G (((1 <= p2) AND (1 <= p9))) U ((((1 <= p0) AND (1 <= p4)) U ((1 <= p2) AND (1 <= p9))) AND ((p0 <= 0) OR (p4 <= 0))))))) : (F (NOT(G (X (((1 <= p10) U ((1 <= p7) AND (1 <= p11))))))) AND F ((1 <= p10))) : NOT(X (X ((G (((1 <= p7) AND (1 <= p11))) U ((G (((NOT(G (((1 <= p13) AND (1 <= p14)))) OR (p3 <= 0)) OR (p5 <= 0))) OR (p13 <= 0)) OR (p14 <= 0)))))) : ((G (((1 <= p1) AND (1 <= p5))) AND (p12 <= 0)) U G ((G (F (((1 <= p3) AND (1 <= p5)))) OR (1 <= p8))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p3) AND (1 <= p5))))
lola: processed formula length: 33
lola: 75 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: 2006 markings, 2006 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (((((p3 <= 0) OR (p5 <= 0)) AND (F (G ((p10 <= 0))) OR G (((p3 <= 0) OR (p5 <= 0))))) R X ((p7 <= 0))))) OR (p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (((((p3 <= 0) OR (p5 <= 0)) AND (F (G ((p10 <= 0))) OR G (((p3 <= 0) OR (p5 <= 0))))) R X ((p7 <= 0))))) OR (p10 <= 0))))
lola: processed formula length: 135
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 54 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: 32048 markings, 46054 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((F (((1 <= p7) AND (1 <= p11))) OR ((1 <= p2) AND (1 <= p9)))) AND ((p8 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F (((1 <= p7) AND (1 <= p11))) OR ((1 <= p2) AND (1 <= p9)))) AND ((p8 <= 0) OR (p6 <= 0))))
lola: processed formula length: 101
lola: 75 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: 5874708 markings, 8811402 edges, 1174942 markings/sec, 0 secs
lola: 10775400 markings, 17544795 edges, 980138 markings/sec, 5 secs
lola: 15249863 markings, 26483938 edges, 894893 markings/sec, 10 secs
lola: 18695916 markings, 33376304 edges, 689211 markings/sec, 15 secs
lola: 21812798 markings, 39610349 edges, 623376 markings/sec, 20 secs
lola: 24999702 markings, 45984533 edges, 637381 markings/sec, 25 secs
lola: 28333135 markings, 52652508 edges, 666687 markings/sec, 30 secs
lola: 32061086 markings, 60111726 edges, 745590 markings/sec, 35 secs
lola: 35693306 markings, 67382161 edges, 726444 markings/sec, 40 secs
lola: 38729596 markings, 74123090 edges, 607258 markings/sec, 45 secs
lola: 41486080 markings, 80326941 edges, 551297 markings/sec, 50 secs
lola: 44212425 markings, 86462957 edges, 545269 markings/sec, 55 secs
lola: 46914985 markings, 92541424 edges, 540512 markings/sec, 60 secs
lola: 49625329 markings, 98642771 edges, 542069 markings/sec, 65 secs
lola: 52328684 markings, 104723967 edges, 540671 markings/sec, 70 secs
lola: 55062645 markings, 110877020 edges, 546792 markings/sec, 75 secs
lola: 57833638 markings, 117112539 edges, 554199 markings/sec, 80 secs
lola: 60580581 markings, 123293336 edges, 549389 markings/sec, 85 secs
lola: 63428302 markings, 129700841 edges, 569544 markings/sec, 90 secs
lola: 66308464 markings, 136181683 edges, 576032 markings/sec, 95 secs
lola: 69247847 markings, 142796360 edges, 587877 markings/sec, 100 secs
lola: 72243615 markings, 149537425 edges, 599154 markings/sec, 105 secs
lola: 75409121 markings, 156661294 edges, 633101 markings/sec, 110 secs
lola: 79210079 markings, 164452386 edges, 760192 markings/sec, 115 secs
lola: 82105220 markings, 170245424 edges, 579028 markings/sec, 120 secs
lola: 84897784 markings, 176252585 edges, 558513 markings/sec, 125 secs
lola: 87516878 markings, 182800757 edges, 523819 markings/sec, 130 secs
lola: 89881124 markings, 188711815 edges, 472849 markings/sec, 135 secs
lola: 92206935 markings, 194526830 edges, 465162 markings/sec, 140 secs
lola: 94529379 markings, 200333503 edges, 464489 markings/sec, 145 secs
lola: 96926963 markings, 206328195 edges, 479517 markings/sec, 150 secs
lola: 99401255 markings, 212515138 edges, 494858 markings/sec, 155 secs
lola: 103077371 markings, 220221499 edges, 735223 markings/sec, 160 secs
lola: 106887261 markings, 227845491 edges, 761978 markings/sec, 165 secs
lola: 109356319 markings, 233371844 edges, 493812 markings/sec, 170 secs
lola: 111147996 markings, 237851037 edges, 358335 markings/sec, 175 secs
lola: 113387615 markings, 243449283 edges, 447924 markings/sec, 180 secs
lola: 115572592 markings, 248912098 edges, 436995 markings/sec, 185 secs
lola: 117590286 markings, 253956704 edges, 403539 markings/sec, 190 secs
lola: 119618015 markings, 259026439 edges, 405546 markings/sec, 195 secs
lola: 121552456 markings, 263862980 edges, 386888 markings/sec, 200 secs
lola: 123369046 markings, 268405045 edges, 363318 markings/sec, 205 secs
lola: 125239613 markings, 273081959 edges, 374113 markings/sec, 210 secs
lola: 127169344 markings, 277907193 edges, 385946 markings/sec, 215 secs
lola: 128917000 markings, 282278544 edges, 349531 markings/sec, 220 secs
lola: 130154268 markings, 285371711 edges, 247454 markings/sec, 225 secs
lola: 131394268 markings, 288471709 edges, 248000 markings/sec, 230 secs
lola: 133199900 markings, 292769864 edges, 361126 markings/sec, 235 secs
lola: 134702247 markings, 296223789 edges, 300469 markings/sec, 240 secs
lola: 136187732 markings, 299641281 edges, 297097 markings/sec, 245 secs
lola: 138081503 markings, 303998030 edges, 378754 markings/sec, 250 secs
lola: 139269901 markings, 306731525 edges, 237680 markings/sec, 255 secs
lola: 140682581 markings, 309980900 edges, 282536 markings/sec, 260 secs
lola: 142633268 markings, 314469073 edges, 390137 markings/sec, 265 secs
lola: 144485252 markings, 318727616 edges, 370397 markings/sec, 270 secs
lola: 146374460 markings, 323073142 edges, 377842 markings/sec, 275 secs
lola: 148260514 markings, 327410335 edges, 377211 markings/sec, 280 secs
lola: 149950156 markings, 331297534 edges, 337928 markings/sec, 285 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p10) OR (G (F (((1 <= p2) AND (1 <= p9)))) AND F ((1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p10) OR (G (F (((1 <= p2) AND (1 <= p9)))) AND F ((1 <= p10))))))
lola: processed formula length: 78
lola: 75 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: 2006 markings, 2006 edges
lola: ========================================
lola: subprocess 4 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p10)) AND (X ((p6 <= 0)) OR ((1 <= p13) AND (1 <= p14)))) OR (G ((G (((1 <= p13) AND (1 <= p14))) OR (1 <= p10))) AND F ((F ((1 <= p10)) AND (X ((p6 <= 0)) OR ((1 <= p13) AND (1 <= p14)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p13) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p13) AND (1 <= p14))
lola: processed formula length: 27
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p10))
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: (p10 <= 0)
lola: processed formula length: 10
lola: 77 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: 18007 markings, 18008 edges
lola: ========================================
lola: subprocess 6 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((1 <= p13) AND (1 <= p14))) OR (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((1 <= p13) AND (1 <= p14))) OR (1 <= p10)))
lola: processed formula length: 51
lola: 75 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: 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: 10005 markings, 10005 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((((1 <= p0) AND (1 <= p4)) U ((1 <= p2) AND (1 <= p9))) AND ((p0 <= 0) OR (p4 <= 0))) OR (G (((1 <= p2) AND (1 <= p9))) AND F (((((1 <= p0) AND (1 <= p4)) U ((1 <= p2) AND (1 <= p9))) AND ((p0 <= 0) OR (p4 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((((1 <= p0) AND (1 <= p4)) U ((1 <= p2) AND (1 <= p9))) AND ((p0 <= 0) OR (p4 <= 0))) OR (G (((1 <= p2) AND (1 <= p9))) AND F (((((1 <= p0) AND (1 <= p4)) U ((1 <= p2) AND (1 <= p9))) AND ((p0 <= 0) OR (p4 <= 0)))))))))
lola: processed formula length: 232
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 2011 markings, 2011 edges
lola: subprocess 6 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (F ((G (((p7 <= 0) OR (p11 <= 0))) OR ((p10 <= 0) AND ((p7 <= 0) OR (p11 <= 0)))))) AND F ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p10))
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: (p10 <= 0)
lola: processed formula length: 10
lola: 77 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: 18007 markings, 18008 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 1091 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND ((1 <= p14) AND (F (((p7 <= 0) OR (p11 <= 0))) OR G ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND (1 <= p14))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND ((1 <= p14) AND (F (((p7 <= 0) OR (p11 <= 0))) OR G ((F ((G (((1 <= p13) AND (1 <= p14))) AND ((1 <= p3) AND (1 <= p5)))) AND ((1 <= p13) AND (1 <= p14))))))))))
lola: processed formula length: 257
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 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: 2006 markings, 2006 edges
lola: ========================================
lola: subprocess 8 will run for 1637 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p3 <= 0) OR (p5 <= 0))))
lola: processed formula length: 33
lola: 75 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: 2007 markings, 2008 edges
lola: ========================================
lola: subprocess 9 will run for 3275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (((1 <= p1) AND (1 <= p5))) AND (p12 <= 0)) U G ((G (F (((1 <= p3) AND (1 <= p5)))) OR (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (((1 <= p1) AND (1 <= p5))) AND (p12 <= 0)) U G ((G (F (((1 <= p3) AND (1 <= p5)))) OR (1 <= p8))))
lola: processed formula length: 103
lola: 75 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 2010 markings, 2010 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((F (((1 <= p7) AND (1 <= p11))) OR ((1 <= p2) AND (1 <= p9)))) AND ((p8 <= 0) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((F (((1 <= p7) AND (1 <= p11))) OR ((1 <= p2) AND (1 <= p9)))) AND ((p8 <= 0) OR (p6 <= 0))))
lola: processed formula length: 101
lola: 75 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: 5891248 markings, 8836228 edges, 1178250 markings/sec, 0 secs
lola: 10772782 markings, 17539562 edges, 976307 markings/sec, 5 secs
lola: 15190975 markings, 26366157 edges, 883639 markings/sec, 10 secs
lola: 18863700 markings, 33711885 edges, 734545 markings/sec, 15 secs
lola: 22193167 markings, 40371126 edges, 665893 markings/sec, 20 secs
lola: 25456531 markings, 46898259 edges, 652673 markings/sec, 25 secs
lola: 28843461 markings, 53673554 edges, 677386 markings/sec, 30 secs
lola: 32591912 markings, 61173964 edges, 749690 markings/sec, 35 secs
lola: 36266846 markings, 68584213 edges, 734987 markings/sec, 40 secs
lola: 39247834 markings, 75291715 edges, 596198 markings/sec, 45 secs
lola: 42094799 markings, 81696872 edges, 569393 markings/sec, 50 secs
lola: 44981263 markings, 88192473 edges, 577293 markings/sec, 55 secs
lola: 47850732 markings, 94648974 edges, 573894 markings/sec, 60 secs
lola: 50636041 markings, 100915404 edges, 557062 markings/sec, 65 secs
lola: 53382813 markings, 107097280 edges, 549354 markings/sec, 70 secs
lola: 56103948 markings, 113219584 edges, 544227 markings/sec, 75 secs
lola: 58898673 markings, 119508743 edges, 558945 markings/sec, 80 secs
lola: 61706985 markings, 125827688 edges, 561662 markings/sec, 85 secs
lola: 64578709 markings, 132288802 edges, 574345 markings/sec, 90 secs
lola: 67530423 markings, 138931493 edges, 590343 markings/sec, 95 secs
lola: 70497553 markings, 145608480 edges, 593426 markings/sec, 100 secs
lola: 73518903 markings, 152407028 edges, 604270 markings/sec, 105 secs
lola: 76960540 markings, 159950791 edges, 688327 markings/sec, 110 secs
lola: 80729243 markings, 167493470 edges, 753741 markings/sec, 115 secs
lola: 83260710 markings, 172556405 edges, 506293 markings/sec, 120 secs
lola: 86227071 markings, 179576019 edges, 593272 markings/sec, 125 secs
lola: 88758682 markings, 185905512 edges, 506322 markings/sec, 130 secs
lola: 91220571 markings, 192060702 edges, 492378 markings/sec, 135 secs
lola: 93673497 markings, 198193580 edges, 490585 markings/sec, 140 secs
lola: 96127968 markings, 204330440 edges, 490894 markings/sec, 145 secs
lola: 98589288 markings, 210484709 edges, 492264 markings/sec, 150 secs
lola: 101731244 markings, 217527194 edges, 628391 markings/sec, 155 secs
lola: 105582326 markings, 225235622 edges, 770216 markings/sec, 160 secs
lola: 108703423 markings, 231739603 edges, 624219 markings/sec, 165 secs
lola: 110543522 markings, 236339851 edges, 368020 markings/sec, 170 secs
lola: 112511898 markings, 241259850 edges, 393675 markings/sec, 175 secs
lola: 114938564 markings, 247326915 edges, 485333 markings/sec, 180 secs
lola: 117093779 markings, 252715340 edges, 431043 markings/sec, 185 secs
lola: 119167811 markings, 257900832 edges, 414806 markings/sec, 190 secs
lola: 121208439 markings, 263002855 edges, 408126 markings/sec, 195 secs
lola: 123223651 markings, 268043422 edges, 403042 markings/sec, 200 secs
lola: 125299391 markings, 273231426 edges, 415148 markings/sec, 205 secs
lola: 127365377 markings, 278397412 edges, 413197 markings/sec, 210 secs
lola: 128877556 markings, 282179931 edges, 302436 markings/sec, 215 secs
lola: 130121692 markings, 285290271 edges, 248827 markings/sec, 220 secs
lola: 131468920 markings, 288658339 edges, 269446 markings/sec, 225 secs
lola: 133250329 markings, 292886101 edges, 356282 markings/sec, 230 secs
lola: 135056432 markings, 297039983 edges, 361221 markings/sec, 235 secs
lola: 136897177 markings, 301274144 edges, 368149 markings/sec, 240 secs
lola: 138846851 markings, 305759086 edges, 389935 markings/sec, 245 secs
lola: 140675464 markings, 309964872 edges, 365723 markings/sec, 250 secs
lola: 142531850 markings, 314234188 edges, 371277 markings/sec, 255 secs
lola: 144354806 markings, 318427229 edges, 364591 markings/sec, 260 secs
lola: 146174831 markings, 322614101 edges, 364005 markings/sec, 265 secs
lola: 148033702 markings, 326889606 edges, 371774 markings/sec, 270 secs
lola: 149719154 markings, 330764835 edges, 337090 markings/sec, 275 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no no
lola:
preliminary result: no no no unknown no no no no no no
lola: memory consumption: 3428 KB
lola: time consumption: 577 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="RobotManipulation-PT-01000"
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 RobotManipulation-PT-01000, 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 r186-oct2-158987938700210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-01000.tgz
mv RobotManipulation-PT-01000 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 ;