Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r208-smll-162089471000050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 gold2020
Input is RobotManipulation-PT-05000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471000050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RobotManipulation-PT-05000-00
FORMULA_NAME RobotManipulation-PT-05000-01
FORMULA_NAME RobotManipulation-PT-05000-02
FORMULA_NAME RobotManipulation-PT-05000-03
FORMULA_NAME RobotManipulation-PT-05000-04
FORMULA_NAME RobotManipulation-PT-05000-05
FORMULA_NAME RobotManipulation-PT-05000-06
FORMULA_NAME RobotManipulation-PT-05000-07
FORMULA_NAME RobotManipulation-PT-05000-08
FORMULA_NAME RobotManipulation-PT-05000-09
FORMULA_NAME RobotManipulation-PT-05000-10
FORMULA_NAME RobotManipulation-PT-05000-11
FORMULA_NAME RobotManipulation-PT-05000-12
FORMULA_NAME RobotManipulation-PT-05000-13
FORMULA_NAME RobotManipulation-PT-05000-14
FORMULA_NAME RobotManipulation-PT-05000-15

=== Now, execution of the tool begins

BK_START 1621032900191

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

FORMULA RobotManipulation-PT-05000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA RobotManipulation-PT-05000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RobotManipulation-PT-05000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RobotManipulation-PT-05000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-05000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-05000-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RobotManipulation-PT-05000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-05000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-05000-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-05000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2159
rslt: Output for LTLFireability @ RobotManipulation-PT-05000

{
"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": "Fri May 14 22:55:05 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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": "G (((1 <= p3) AND (1 <= p5)))",
"processed_size": 29,
"rewrites": 122
},
"result":
{
"edges": 50005,
"markings": 50005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((((1 <= p3) AND (1 <= p5)) OR (1 <= p8)))",
"processed_size": 45,
"rewrites": 122
},
"result":
{
"edges": 10006,
"markings": 10006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (F ((F ((G ((1 <= p8)) OR ((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND (1 <= p14)))))) AND (1 <= p7)))",
"processed_size": 116,
"rewrites": 122
},
"result":
{
"edges": 10006,
"markings": 10006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) OR (X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) AND F (G (((1 <= p1) AND (1 <= p5)))))))",
"processed_size": 148,
"rewrites": 122
},
"result":
{
"edges": 10008,
"markings": 10007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 299
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"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 (((p7 <= 0) OR (p11 <= 0)))",
"processed_size": 30,
"rewrites": 122
},
"result":
{
"edges": 50005,
"markings": 50005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p1) AND (1 <= p5))) AND (((p7 <= 0) OR (p11 <= 0)) AND (((p7 <= 0) OR (p11 <= 0)) AND ((1 <= p13) AND (1 <= p14))))))",
"processed_size": 133,
"rewrites": 122
},
"result":
{
"edges": 10007,
"markings": 10007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (X (G ((F (((1 <= p2) AND (1 <= p9))) AND X ((1 <= p8)))))))",
"processed_size": 65,
"rewrites": 122
},
"result":
{
"edges": 10006,
"markings": 10006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G (((p7 <= 0) OR (p11 <= 0))) OR ((1 <= p13) AND (1 <= p14)))))",
"processed_size": 71,
"rewrites": 122
},
"result":
{
"edges": 10009,
"markings": 10009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 438
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (((X (F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p2) AND (1 <= p9))))) AND (((p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)))) R (p6 <= 0)))",
"processed_size": 151,
"rewrites": 122
},
"result":
{
"edges": 70012,
"markings": 60011,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 511
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X (X (X (G (((p7 <= 0) OR (p11 <= 0)))))) OR G (((p7 <= 0) OR (p11 <= 0))))))",
"processed_size": 86,
"rewrites": 122
},
"result":
{
"edges": 10020,
"markings": 10019,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 31
},
"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": 613
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((1 <= p3) AND (1 <= p5))))",
"processed_size": 33,
"rewrites": 122
},
"result":
{
"edges": 10010,
"markings": 10010,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 3,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((G ((p7 <= 0)) OR (1 <= p12)) U (F (((1 <= p13) AND (1 <= p14))) U (((p13 <= 0) OR (p14 <= 0)) U ((1 <= p7) OR ((1 <= p13) AND (1 <= p14))))))",
"processed_size": 145,
"rewrites": 122
},
"result":
{
"edges": 60008,
"markings": 40007,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 11,
"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": 1022
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((((1 <= p7) AND (1 <= p11)) R ((((p0 <= 0) OR (p4 <= 0) OR (p12 <= 0)) R ((p0 <= 0) OR (p4 <= 0))) OR (1 <= p12))))",
"processed_size": 121,
"rewrites": 122
},
"result":
{
"edges": 10006,
"markings": 10006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"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": 1533
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1533
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((1 <= p6))",
"processed_size": 13,
"rewrites": 122
},
"result":
{
"edges": 50005,
"markings": 50005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 3067
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p6)))",
"processed_size": 17,
"rewrites": 122
},
"result":
{
"edges": 50007,
"markings": 50006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3067
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p6)",
"processed_size": 9,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)))",
"processed_size": 57,
"rewrites": 124
},
"result":
{
"edges": 40004,
"markings": 40004,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p6)",
"processed_size": 9,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((1 <= p8))",
"processed_size": 13,
"rewrites": 122
},
"result":
{
"edges": 50005,
"markings": 50005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)))",
"processed_size": 57,
"rewrites": 124
},
"result":
{
"edges": 40004,
"markings": 40004,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3816,
"runtime": 1410.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((* R ((* R *) OR *))) : ((G(*) OR **) U (F(**) U (** U **))) : (X(**) OR G(**)) : X((X(X(F((F((G(**) OR **)) AND (* AND *))))) AND **)) : G(F((F(G(*)) OR (G(*) R X(X(F(*))))))) : F((X(F(**)) OR (X(F(**)) AND F(G(**))))) : (X((F(**) AND (** AND (** AND (** AND **))))) OR G(*)) : X(X(X(G((F(**) AND X(**)))))) : X(G((G(*) OR **))) : X((F(**) OR (F(**) AND F(G(*))))) : G(((X(F((F(**) AND (** AND **)))) AND (* AND *)) R *)) : (G(**) OR (F(G(**)) AND F(G(*)))) : F(G((X(X(X(G(*)))) OR G(*)))) : G(F(**)) : (F(**) OR (G(**) OR **))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no yes no no unknown no no no no unknown no no no no no ",
"value": "no yes no no unknown no no no no unknown 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: F (NOT((((p7 <= 0) OR (p11 <= 0)) U ((((1 <= p0) AND (1 <= p4) AND (1 <= p12)) U ((1 <= p0) AND (1 <= p4))) AND (p12 <= 0))))) : ((NOT(F ((1 <= p7))) OR (1 <= p12)) U (F (((1 <= p13) AND (1 <= p14))) U (((p13 <= 0) OR (p14 <= 0)) U ((1 <= p7) OR ((1 <= p13) AND (1 <= p14)))))) : (X ((((1 <= p3) AND (1 <= p5)) OR (1 <= p8))) OR G (((1 <= p3) AND (1 <= p5)))) : X ((F (X (NOT(X (((NOT(F ((G ((1 <= p8)) OR ((1 <= p13) AND (1 <= p14))))) OR (p13 <= 0)) OR (p14 <= 0)))))) AND (1 <= p7))) : NOT(F (G ((G (F (((1 <= p1) AND (1 <= p5)))) AND (F (((p13 <= 0) OR (p14 <= 0))) U X (X (G (((1 <= p13) AND (1 <= p14)))))))))) : F ((F (G (((1 <= p1) AND (1 <= p5)))) U F (X (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))))) : (X (((((F (((1 <= p1) AND (1 <= p5))) AND ((p7 <= 0) OR (p11 <= 0))) AND ((p7 <= 0) OR (p11 <= 0))) AND (1 <= p13)) AND (1 <= p14))) OR NOT(F (((1 <= p7) AND (1 <= p11))))) : X (G (X (X ((F (((1 <= p2) AND (1 <= p9))) AND X ((1 <= p8))))))) : G (X ((NOT(F (((1 <= p7) AND (1 <= p11)))) OR ((1 <= p13) AND (1 <= p14))))) : X ((NOT(G (X (X (F ((1 <= p6)))))) U F (((1 <= p1) AND (1 <= p5))))) : G (NOT((((X (NOT(F (((F (((1 <= p2) AND (1 <= p9))) AND (1 <= p2)) AND (1 <= p9))))) OR ((1 <= p3) AND (1 <= p5))) OR ((1 <= p0) AND (1 <= p4))) U (1 <= p6)))) : (F (NOT(F (G (F (X ((p6 <= 0))))))) U G ((1 <= p6))) : F (G (X ((NOT(X (X (F (X (F (((1 <= p7) AND (1 <= p11)))))))) OR NOT(F (((1 <= p7) AND (1 <= p11)))))))) : X (G (X (G (F (X ((((NOT(G (((1 <= p7) AND (1 <= p11)))) OR (p3 <= 0)) OR (p5 <= 0)) U F (((1 <= p3) AND (1 <= p5)))))))))) : ((F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p9)))) OR G ((1 <= p8))) OR (1 <= p6))
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:318
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:254
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k: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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p3) AND (1 <= p5)) OR (1 <= p8))) OR G (((1 <= p3) AND (1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p3) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p3) AND (1 <= p5)))
lola: processed formula length: 29
lola: 122 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: 50005 markings, 50005 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((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: X ((((1 <= p3) AND (1 <= p5)) OR (1 <= p8)))
lola: processed formula length: 45
lola: 122 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: 10006 markings, 10006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (F ((F ((G ((1 <= p8)) OR ((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND (1 <= p14)))))) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (F ((F ((G ((1 <= p8)) OR ((1 <= p13) AND (1 <= p14)))) AND ((1 <= p13) AND (1 <= p14)))))) AND (1 <= p7)))
lola: processed formula length: 116
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 10006 markings, 10006 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p1 <= 0) OR (p5 <= 0)))) OR (G (((1 <= p13) AND (1 <= p14))) R X (X (F (((p13 <= 0) OR (p14 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p1 <= 0) OR (p5 <= 0)))) OR (G (((1 <= p13) AND (1 <= p14))) R X (X (F (((p13 <= 0) OR (p14 <= 0)))))))))
lola: processed formula length: 122
lola: 122 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2203929 markings, 3223865 edges, 440786 markings/sec, 0 secs
lola: 4490245 markings, 6926826 edges, 457263 markings/sec, 5 secs
lola: 6508975 markings, 10544011 edges, 403746 markings/sec, 10 secs
lola: 8636265 markings, 14547570 edges, 425458 markings/sec, 15 secs
lola: 10222991 markings, 18231187 edges, 317345 markings/sec, 20 secs
lola: 11525681 markings, 21617941 edges, 260538 markings/sec, 25 secs
lola: 12993543 markings, 25072806 edges, 293572 markings/sec, 30 secs
lola: 14330907 markings, 28452749 edges, 267473 markings/sec, 35 secs
lola: 15547152 markings, 31725300 edges, 243249 markings/sec, 40 secs
lola: 16852116 markings, 35120674 edges, 260993 markings/sec, 45 secs
lola: 18056152 markings, 38369352 edges, 240807 markings/sec, 50 secs
lola: 19195984 markings, 41534341 edges, 227966 markings/sec, 55 secs
lola: 20277834 markings, 44654782 edges, 216370 markings/sec, 60 secs
lola: 21330191 markings, 47739587 edges, 210471 markings/sec, 65 secs
lola: 22580284 markings, 51044883 edges, 250019 markings/sec, 70 secs
lola: 23663757 markings, 54121841 edges, 216695 markings/sec, 75 secs
lola: 24677406 markings, 57162745 edges, 202730 markings/sec, 80 secs
lola: 25742918 markings, 60244236 edges, 213102 markings/sec, 85 secs
lola: 26874474 markings, 63358678 edges, 226311 markings/sec, 90 secs
lola: 27868936 markings, 66330024 edges, 198892 markings/sec, 95 secs
lola: 28829375 markings, 69263883 edges, 192088 markings/sec, 100 secs
lola: 29784478 markings, 72174456 edges, 191021 markings/sec, 105 secs
lola: 30748484 markings, 75113614 edges, 192801 markings/sec, 110 secs
lola: 31719830 markings, 78058645 edges, 194269 markings/sec, 115 secs
lola: 32689677 markings, 80983735 edges, 193969 markings/sec, 120 secs
lola: 33766809 markings, 83994490 edges, 215426 markings/sec, 125 secs
lola: 34700398 markings, 86844020 edges, 186718 markings/sec, 130 secs
lola: 35624509 markings, 89679021 edges, 184822 markings/sec, 135 secs
lola: 36522507 markings, 92467959 edges, 179600 markings/sec, 140 secs
lola: 37409053 markings, 95243903 edges, 177309 markings/sec, 145 secs
lola: 38443709 markings, 98150579 edges, 206931 markings/sec, 150 secs
lola: 39344564 markings, 100891598 edges, 180171 markings/sec, 155 secs
lola: 40255212 markings, 103623680 edges, 182130 markings/sec, 160 secs
lola: 41155642 markings, 106353071 edges, 180086 markings/sec, 165 secs
lola: 42029112 markings, 109044431 edges, 174694 markings/sec, 170 secs
lola: 42884226 markings, 111714399 edges, 171023 markings/sec, 175 secs
lola: 43701961 markings, 114393992 edges, 163547 markings/sec, 180 secs
lola: 44560071 markings, 117045646 edges, 171622 markings/sec, 185 secs
lola: 45370937 markings, 119668122 edges, 162173 markings/sec, 190 secs
lola: 46227349 markings, 122320860 edges, 171282 markings/sec, 195 secs
lola: 47077132 markings, 124957531 edges, 169957 markings/sec, 200 secs
lola: 47985270 markings, 127656259 edges, 181628 markings/sec, 205 secs
lola: 48780833 markings, 130160778 edges, 159113 markings/sec, 210 secs
lola: 49597781 markings, 132762848 edges, 163390 markings/sec, 215 secs
lola: 50415840 markings, 135348870 edges, 163612 markings/sec, 220 secs
lola: 51221594 markings, 137913817 edges, 161151 markings/sec, 225 secs
lola: 52038722 markings, 140457168 edges, 163426 markings/sec, 230 secs
lola: 52861307 markings, 143107719 edges, 164517 markings/sec, 235 secs
lola: 53811047 markings, 145817131 edges, 189948 markings/sec, 240 secs
lola: 54620584 markings, 148474569 edges, 161907 markings/sec, 245 secs
lola: 55519199 markings, 151172137 edges, 179723 markings/sec, 250 secs
lola: 56361604 markings, 153867587 edges, 168481 markings/sec, 255 secs
lola: 57277676 markings, 156611015 edges, 183214 markings/sec, 260 secs
lola: 58084712 markings, 159268693 edges, 161407 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10067500 KB
lola: time consumption: 277 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) OR (X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) AND F (G (((1 <= p1) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) OR (X (F (((1 <= p6) OR ((1 <= p1) AND (1 <= p5))))) AND F (G (((1 <= p1) AND (1 <= p5)))))))
lola: processed formula length: 148
lola: 122 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: 10007 markings, 10008 edges
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p1) AND (1 <= p5))) AND (((p7 <= 0) OR (p11 <= 0)) AND (((p7 <= 0) OR (p11 <= 0)) AND ((1 <= p13) AND (1 <= p14)))))) OR G (((p7 <= 0) OR (p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p7 <= 0) OR (p11 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p7 <= 0) OR (p11 <= 0)))
lola: processed formula length: 30
lola: 122 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: 50005 markings, 50005 edges
lola: ========================================
lola: subprocess 5 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p1) AND (1 <= p5))) AND (((p7 <= 0) OR (p11 <= 0)) AND (((p7 <= 0) OR (p11 <= 0)) 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 ((F (((1 <= p1) AND (1 <= p5))) AND (((p7 <= 0) OR (p11 <= 0)) AND (((p7 <= 0) OR (p11 <= 0)) AND ((1 <= p13) AND (1 <= p14))))))
lola: processed formula length: 133
lola: 122 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: 10007 markings, 10007 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((F (((1 <= p2) AND (1 <= p9))) AND X ((1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((F (((1 <= p2) AND (1 <= p9))) AND X ((1 <= p8)))))))
lola: processed formula length: 65
lola: 122 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: 10006 markings, 10006 edges
lola: ========================================
lola: subprocess 6 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p7 <= 0) OR (p11 <= 0))) OR ((1 <= p13) AND (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p7 <= 0) OR (p11 <= 0))) OR ((1 <= p13) AND (1 <= p14)))))
lola: processed formula length: 71
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10009 markings, 10009 edges
lola: ========================================
lola: subprocess 7 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p1) AND (1 <= p5))) OR (F (((1 <= p1) AND (1 <= p5))) AND F (G ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p1) AND (1 <= p5))) OR (F (((1 <= p1) AND (1 <= p5))) AND F (G ((p6 <= 0))))))
lola: processed formula length: 92
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3466999 markings, 4457224 edges, 693400 markings/sec, 0 secs
lola: 6949479 markings, 8936419 edges, 696496 markings/sec, 5 secs
lola: 10400471 markings, 13372133 edges, 690198 markings/sec, 10 secs
lola: 13581307 markings, 17463283 edges, 636167 markings/sec, 15 secs
lola: 16854398 markings, 21670519 edges, 654618 markings/sec, 20 secs
lola: 20199896 markings, 25964925 edges, 669100 markings/sec, 25 secs
lola: 23641306 markings, 30394681 edges, 688282 markings/sec, 30 secs
lola: 27100836 markings, 34835995 edges, 691906 markings/sec, 35 secs
lola: 30407327 markings, 39093740 edges, 661298 markings/sec, 40 secs
lola: 33817275 markings, 43473948 edges, 681990 markings/sec, 45 secs
lola: 37225182 markings, 47856893 edges, 681581 markings/sec, 50 secs
lola: 40632079 markings, 52239333 edges, 681379 markings/sec, 55 secs
lola: 44028919 markings, 56608082 edges, 679368 markings/sec, 60 secs
lola: 47456179 markings, 61011714 edges, 685452 markings/sec, 65 secs
lola: 50812115 markings, 65328134 edges, 671187 markings/sec, 70 secs
lola: 54158228 markings, 69631144 edges, 669223 markings/sec, 75 secs
lola: 57596477 markings, 74051837 edges, 687650 markings/sec, 80 secs
lola: 61015594 markings, 78442198 edges, 683823 markings/sec, 85 secs
lola: 64402743 markings, 82799537 edges, 677430 markings/sec, 90 secs
lola: 67766561 markings, 87128200 edges, 672764 markings/sec, 95 secs
lola: 71171253 markings, 91503675 edges, 680938 markings/sec, 100 secs
lola: 74596442 markings, 95903950 edges, 685038 markings/sec, 105 secs
lola: 77998525 markings, 100281908 edges, 680417 markings/sec, 110 secs
lola: 81385262 markings, 104632375 edges, 677347 markings/sec, 115 secs
lola: 84672838 markings, 108856203 edges, 657515 markings/sec, 120 secs
lola: 88041557 markings, 113193006 edges, 673744 markings/sec, 125 secs
lola: 91373419 markings, 117479330 edges, 666372 markings/sec, 130 secs
lola: 94693904 markings, 121740178 edges, 664097 markings/sec, 135 secs
lola: 97642117 markings, 125538213 edges, 589643 markings/sec, 140 secs
lola: 99196893 markings, 127535745 edges, 310955 markings/sec, 145 secs
lola: 101189913 markings, 130099483 edges, 398604 markings/sec, 150 secs
lola: 103171900 markings, 132648700 edges, 396397 markings/sec, 155 secs
lola: 104271536 markings, 134058756 edges, 219927 markings/sec, 160 secs
lola: 107066583 markings, 137653566 edges, 559009 markings/sec, 165 secs
lola: 108059768 markings, 138931543 edges, 198637 markings/sec, 170 secs
lola: 110549468 markings, 142131912 edges, 497940 markings/sec, 175 secs
lola: 112061830 markings, 144075590 edges, 302472 markings/sec, 180 secs
lola: 114681948 markings, 147446696 edges, 524024 markings/sec, 185 secs
lola: 116789750 markings, 150150691 edges, 421560 markings/sec, 190 secs
lola: 119367052 markings, 153470260 edges, 515460 markings/sec, 195 secs
lola: 120519580 markings, 154950595 edges, 230506 markings/sec, 200 secs
lola: 120523169 markings, 154954902 edges, 718 markings/sec, 205 secs
lola: 120571348 markings, 155015224 edges, 9636 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p2) AND (1 <= p9))))) AND (((p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)))) R (p6 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (F ((F (((1 <= p2) AND (1 <= p9))) AND ((1 <= p2) AND (1 <= p9))))) AND (((p3 <= 0) OR (p5 <= 0)) AND ((p0 <= 0) OR (p4 <= 0)))) R (p6 <= 0)))
lola: processed formula length: 151
lola: 122 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: 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: 60011 markings, 70012 edges
lola: ========================================
lola: subprocess 9 will run for 511 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (X (X (G (((p7 <= 0) OR (p11 <= 0)))))) OR G (((p7 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (X (X (G (((p7 <= 0) OR (p11 <= 0)))))) OR G (((p7 <= 0) OR (p11 <= 0))))))
lola: processed formula length: 86
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 31 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: 10019 markings, 10020 edges
lola: ========================================
lola: subprocess 10 will run for 613 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p3) AND (1 <= p5))))
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 <= p3) AND (1 <= p5))))
lola: processed formula length: 33
lola: 122 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: 10010 markings, 10010 edges
lola: ========================================
lola: subprocess 11 will run for 766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G ((p7 <= 0)) OR (1 <= p12)) U (F (((1 <= p13) AND (1 <= p14))) U (((p13 <= 0) OR (p14 <= 0)) U ((1 <= p7) OR ((1 <= p13) AND (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G ((p7 <= 0)) OR (1 <= p12)) U (F (((1 <= p13) AND (1 <= p14))) U (((p13 <= 0) OR (p14 <= 0)) U ((1 <= p7) OR ((1 <= p13) AND (1 <= p14))))))
lola: processed formula length: 145
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 40007 markings, 60008 edges
lola: ========================================
lola: subprocess 12 will run for 1022 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p7) AND (1 <= p11)) R ((((p0 <= 0) OR (p4 <= 0) OR (p12 <= 0)) R ((p0 <= 0) OR (p4 <= 0))) OR (1 <= p12))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((1 <= p7) AND (1 <= p11)) R ((((p0 <= 0) OR (p4 <= 0) OR (p12 <= 0)) R ((p0 <= 0) OR (p4 <= 0))) OR (1 <= p12))))
lola: processed formula length: 121
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10006 markings, 10006 edges
lola: ========================================
lola: subprocess 13 will run for 1533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p6)) OR (F (G ((1 <= p6))) AND F (G ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p6))
lola: processed formula length: 13
lola: 122 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: 50005 markings, 50005 edges
lola: ========================================
lola: subprocess 14 will run for 3067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p6)))
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 <= p6)))
lola: processed formula length: 17
lola: 122 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: 50006 markings, 50007 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 3067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p9)))) OR (G ((1 <= p8)) OR (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3067 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p6)
lola: processed formula length: 9
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p9))))
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: (((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)))
lola: processed formula length: 57
lola: 124 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: 40004 markings, 40004 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((F (G (((p1 <= 0) OR (p5 <= 0)))) OR (G (((1 <= p13) AND (1 <= p14))) R X (X (F (((p13 <= 0) OR (p14 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G (((p1 <= 0) OR (p5 <= 0)))) OR (G (((1 <= p13) AND (1 <= p14))) R X (X (F (((p13 <= 0) OR (p14 <= 0)))))))))
lola: processed formula length: 122
lola: 122 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2180597 markings, 3187201 edges, 436119 markings/sec, 0 secs
lola: 4085437 markings, 6234185 edges, 380968 markings/sec, 5 secs
lola: 6050529 markings, 9772337 edges, 393018 markings/sec, 10 secs
lola: 8304548 markings, 13817784 edges, 450804 markings/sec, 15 secs
lola: 9966845 markings, 17565331 edges, 332459 markings/sec, 20 secs
lola: 11298032 markings, 21007488 edges, 266237 markings/sec, 25 secs
lola: 12765466 markings, 24433799 edges, 293487 markings/sec, 30 secs
lola: 14093067 markings, 27779489 edges, 265520 markings/sec, 35 secs
lola: 15296163 markings, 31021481 edges, 240619 markings/sec, 40 secs
lola: 16411594 markings, 34198547 edges, 223086 markings/sec, 45 secs
lola: 17794229 markings, 37596077 edges, 276527 markings/sec, 50 secs
lola: 18916483 markings, 40722050 edges, 224451 markings/sec, 55 secs
lola: 19989698 markings, 43813342 edges, 214643 markings/sec, 60 secs
lola: 21031888 markings, 46863720 edges, 208438 markings/sec, 65 secs
lola: 22062919 markings, 49890217 edges, 206206 markings/sec, 70 secs
lola: 23310144 markings, 53146717 edges, 249445 markings/sec, 75 secs
lola: 24315855 markings, 56058999 edges, 201142 markings/sec, 80 secs
lola: 25356619 markings, 59090166 edges, 208153 markings/sec, 85 secs
lola: 26347886 markings, 62045955 edges, 198253 markings/sec, 90 secs
lola: 27452224 markings, 65104742 edges, 220868 markings/sec, 95 secs
lola: 28404406 markings, 67967128 edges, 190436 markings/sec, 100 secs
lola: 29383146 markings, 70905927 edges, 195748 markings/sec, 105 secs
lola: 30344756 markings, 73837449 edges, 192322 markings/sec, 110 secs
lola: 31279555 markings, 76758576 edges, 186960 markings/sec, 115 secs
lola: 32200599 markings, 79551125 edges, 184209 markings/sec, 120 secs
lola: 33149947 markings, 82419419 edges, 189870 markings/sec, 125 secs
lola: 34203770 markings, 85341827 edges, 210765 markings/sec, 130 secs
lola: 35123514 markings, 88142460 edges, 183949 markings/sec, 135 secs
lola: 36069728 markings, 91039143 edges, 189243 markings/sec, 140 secs
lola: 36988243 markings, 93900362 edges, 183703 markings/sec, 145 secs
lola: 37901585 markings, 96760659 edges, 182668 markings/sec, 150 secs
lola: 38970350 markings, 99725925 edges, 213753 markings/sec, 155 secs
lola: 39886594 markings, 102547575 edges, 183249 markings/sec, 160 secs
lola: 40850014 markings, 105403743 edges, 192684 markings/sec, 165 secs
lola: 41770746 markings, 108243964 edges, 184146 markings/sec, 170 secs
lola: 42677435 markings, 111063878 edges, 181338 markings/sec, 175 secs
lola: 43544325 markings, 113869815 edges, 173378 markings/sec, 180 secs
lola: 44442431 markings, 116683931 edges, 179621 markings/sec, 185 secs
lola: 45306356 markings, 119463775 edges, 172785 markings/sec, 190 secs
lola: 46225851 markings, 122313639 edges, 183899 markings/sec, 195 secs
lola: 47130982 markings, 125161153 edges, 181026 markings/sec, 200 secs
lola: 48107623 markings, 128041706 edges, 195328 markings/sec, 205 secs
lola: 48993840 markings, 130850426 edges, 177243 markings/sec, 210 secs
lola: 49881531 markings, 133667766 edges, 177538 markings/sec, 215 secs
lola: 50760684 markings, 136463775 edges, 175831 markings/sec, 220 secs
lola: 51639351 markings, 139235583 edges, 175733 markings/sec, 225 secs
lola: 52521886 markings, 142022907 edges, 176507 markings/sec, 230 secs
lola: 53497288 markings, 144865900 edges, 195080 markings/sec, 235 secs
lola: 54368091 markings, 147659098 edges, 174161 markings/sec, 240 secs
lola: 55296308 markings, 150453421 edges, 185643 markings/sec, 245 secs
lola: 56159461 markings, 153201316 edges, 172631 markings/sec, 250 secs
lola: 57021963 markings, 155950175 edges, 172500 markings/sec, 255 secs
lola: 57912576 markings, 158710048 edges, 178123 markings/sec, 260 secs
lola: 58745489 markings, 161425212 edges, 166583 markings/sec, 265 secs
lola: 59587443 markings, 164118966 edges, 168391 markings/sec, 270 secs
lola: 60441040 markings, 166811665 edges, 170719 markings/sec, 275 secs
lola: 61301136 markings, 169506310 edges, 172019 markings/sec, 280 secs
lola: 62119259 markings, 172183881 edges, 163625 markings/sec, 285 secs
lola: 62959067 markings, 174861841 edges, 167962 markings/sec, 290 secs
lola: 63780559 markings, 177529027 edges, 164298 markings/sec, 295 secs
lola: 64604990 markings, 180193211 edges, 164886 markings/sec, 300 secs
lola: 65518918 markings, 182898421 edges, 182786 markings/sec, 305 secs
lola: 66354330 markings, 185554570 edges, 167082 markings/sec, 310 secs
lola: 67173097 markings, 188195082 edges, 163753 markings/sec, 315 secs
lola: 67989889 markings, 190849476 edges, 163358 markings/sec, 320 secs
lola: 68849418 markings, 193582537 edges, 171906 markings/sec, 325 secs
lola: 69690649 markings, 196246497 edges, 168246 markings/sec, 330 secs
lola: 70482514 markings, 198885245 edges, 158373 markings/sec, 335 secs
lola: 71302376 markings, 201533899 edges, 163972 markings/sec, 340 secs
lola: 72145484 markings, 204200984 edges, 168622 markings/sec, 345 secs
lola: 72954847 markings, 206827918 edges, 161873 markings/sec, 350 secs
lola: 73769325 markings, 209470209 edges, 162896 markings/sec, 355 secs
lola: 74568849 markings, 212106975 edges, 159905 markings/sec, 360 secs
lola: 75386869 markings, 214734590 edges, 163604 markings/sec, 365 secs
lola: 76187457 markings, 217361922 edges, 160118 markings/sec, 370 secs
lola: 76970793 markings, 219975253 edges, 156667 markings/sec, 375 secs
lola: 77765476 markings, 222598663 edges, 158937 markings/sec, 380 secs
lola: 78584947 markings, 225224206 edges, 163894 markings/sec, 385 secs
lola: 79386683 markings, 227831654 edges, 160347 markings/sec, 390 secs
lola: 80152202 markings, 230387481 edges, 153104 markings/sec, 395 secs
lola: 80959981 markings, 232945606 edges, 161556 markings/sec, 400 secs
lola: 81702283 markings, 235423663 edges, 148460 markings/sec, 405 secs
lola: 82468090 markings, 237955153 edges, 153161 markings/sec, 410 secs
lola: 83266496 markings, 240524070 edges, 159681 markings/sec, 415 secs
lola: 84070134 markings, 242994090 edges, 160728 markings/sec, 420 secs
lola: 84797236 markings, 245448204 edges, 145420 markings/sec, 425 secs
lola: 85597344 markings, 248019660 edges, 160022 markings/sec, 430 secs
lola: 86379910 markings, 250540573 edges, 156513 markings/sec, 435 secs
lola: 87136722 markings, 253049995 edges, 151362 markings/sec, 440 secs
lola: 87924999 markings, 255512950 edges, 157655 markings/sec, 445 secs
lola: 88649442 markings, 257847675 edges, 144889 markings/sec, 450 secs
lola: 89381342 markings, 260282643 edges, 146380 markings/sec, 455 secs
lola: 90150305 markings, 262778629 edges, 153793 markings/sec, 460 secs
lola: 90904664 markings, 265274340 edges, 150872 markings/sec, 465 secs
lola: 91654409 markings, 267738575 edges, 149949 markings/sec, 470 secs
lola: 92386567 markings, 270195818 edges, 146432 markings/sec, 475 secs
lola: 93130553 markings, 272657223 edges, 148797 markings/sec, 480 secs
lola: 93771769 markings, 274835950 edges, 128243 markings/sec, 485 secs
lola: 94473576 markings, 277148853 edges, 140361 markings/sec, 490 secs
lola: 95201981 markings, 279553185 edges, 145681 markings/sec, 495 secs
lola: 95936192 markings, 281917721 edges, 146842 markings/sec, 500 secs
lola: 96769299 markings, 284634990 edges, 166621 markings/sec, 505 secs
lola: 97479034 markings, 287012292 edges, 141947 markings/sec, 510 secs
lola: 98185120 markings, 289273041 edges, 141217 markings/sec, 515 secs
lola: 98886300 markings, 291627847 edges, 140236 markings/sec, 520 secs
lola: 99614276 markings, 293974172 edges, 145595 markings/sec, 525 secs
lola: 100296814 markings, 296280739 edges, 136508 markings/sec, 530 secs
lola: 100977880 markings, 298574609 edges, 136213 markings/sec, 535 secs
lola: 101688476 markings, 300903842 edges, 142119 markings/sec, 540 secs
lola: 102315859 markings, 302951197 edges, 125477 markings/sec, 545 secs
lola: 103024845 markings, 305277538 edges, 141797 markings/sec, 550 secs
lola: 103715398 markings, 307570801 edges, 138111 markings/sec, 555 secs
lola: 104329305 markings, 309624659 edges, 122781 markings/sec, 560 secs
lola: 104945708 markings, 311719085 edges, 123281 markings/sec, 565 secs
lola: 105666827 markings, 313999802 edges, 144224 markings/sec, 570 secs
lola: 106299390 markings, 316067399 edges, 126513 markings/sec, 575 secs
lola: 106874860 markings, 318030160 edges, 115094 markings/sec, 580 secs
lola: 107501457 markings, 320112906 edges, 125319 markings/sec, 585 secs
lola: 108151615 markings, 322233137 edges, 130032 markings/sec, 590 secs
lola: 108801524 markings, 324418903 edges, 129982 markings/sec, 595 secs
lola: 109379836 markings, 326367358 edges, 115662 markings/sec, 600 secs
lola: 110011513 markings, 328441604 edges, 126335 markings/sec, 605 secs
lola: 110549989 markings, 330189185 edges, 107695 markings/sec, 610 secs
lola: 111153553 markings, 332112612 edges, 120713 markings/sec, 615 secs
lola: 111688395 markings, 333839822 edges, 106968 markings/sec, 620 secs
lola: 112315161 markings, 335867911 edges, 125353 markings/sec, 625 secs
lola: 112844693 markings, 337652017 edges, 105906 markings/sec, 630 secs
lola: 113486203 markings, 339788592 edges, 128302 markings/sec, 635 secs
lola: 114164628 markings, 342045115 edges, 135685 markings/sec, 640 secs
lola: 114830899 markings, 344389994 edges, 133254 markings/sec, 645 secs
lola: 115458938 markings, 346496807 edges, 125608 markings/sec, 650 secs
lola: 116023383 markings, 348435929 edges, 112889 markings/sec, 655 secs
lola: 116664861 markings, 350653617 edges, 128296 markings/sec, 660 secs
lola: 116831762 markings, 351018994 edges, 33380 markings/sec, 665 secs
lola: 116831800 markings, 351019080 edges, 8 markings/sec, 670 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p1) AND (1 <= p5))) OR (F (((1 <= p1) AND (1 <= p5))) AND F (G ((p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p1) AND (1 <= p5))) OR (F (((1 <= p1) AND (1 <= p5))) AND F (G ((p6 <= 0))))))
lola: processed formula length: 92
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3200032 markings, 4116499 edges, 640006 markings/sec, 0 secs
lola: 6510183 markings, 8366621 edges, 662030 markings/sec, 5 secs
lola: 9759149 markings, 12545126 edges, 649793 markings/sec, 10 secs
lola: 13160163 markings, 16921752 edges, 680203 markings/sec, 15 secs
lola: 16526466 markings, 21240060 edges, 673261 markings/sec, 20 secs
lola: 19902573 markings, 25586261 edges, 675221 markings/sec, 25 secs
lola: 23317026 markings, 29973121 edges, 682891 markings/sec, 30 secs
lola: 26724247 markings, 34354278 edges, 681444 markings/sec, 35 secs
lola: 30128700 markings, 38736447 edges, 680891 markings/sec, 40 secs
lola: 33501470 markings, 43069832 edges, 674554 markings/sec, 45 secs
lola: 36854841 markings, 47375961 edges, 670674 markings/sec, 50 secs
lola: 40187600 markings, 51667474 edges, 666552 markings/sec, 55 secs
lola: 43488600 markings, 55915098 edges, 660200 markings/sec, 60 secs
lola: 46817723 markings, 60189552 edges, 665825 markings/sec, 65 secs
lola: 50135668 markings, 64461423 edges, 663589 markings/sec, 70 secs
lola: 53462517 markings, 68731601 edges, 665370 markings/sec, 75 secs
lola: 56740079 markings, 72949549 edges, 655512 markings/sec, 80 secs
lola: 60126824 markings, 77300038 edges, 677349 markings/sec, 85 secs
lola: 63539302 markings, 81683951 edges, 682496 markings/sec, 90 secs
lola: 66965767 markings, 86092677 edges, 685293 markings/sec, 95 secs
lola: 70418884 markings, 90536519 edges, 690623 markings/sec, 100 secs
lola: 73877486 markings, 94985320 edges, 691720 markings/sec, 105 secs
lola: 77285379 markings, 99362613 edges, 681579 markings/sec, 110 secs
lola: 80709268 markings, 103766972 edges, 684778 markings/sec, 115 secs
lola: 84091156 markings, 108114376 edges, 676378 markings/sec, 120 secs
lola: 87512963 markings, 112517135 edges, 684361 markings/sec, 125 secs
lola: 90933223 markings, 116911501 edges, 684052 markings/sec, 130 secs
lola: 94365708 markings, 121324789 edges, 686497 markings/sec, 135 secs
lola: 97452865 markings, 125291937 edges, 617431 markings/sec, 140 secs
lola: 98871886 markings, 127114497 edges, 283804 markings/sec, 145 secs
lola: 100099450 markings, 128700050 edges, 245513 markings/sec, 150 secs
lola: 102185960 markings, 131377905 edges, 417302 markings/sec, 155 secs
lola: 104062309 markings, 133787056 edges, 375270 markings/sec, 160 secs
lola: 104823030 markings, 134770890 edges, 152144 markings/sec, 165 secs
lola: 106879495 markings, 137410913 edges, 411293 markings/sec, 170 secs
lola: 108180150 markings, 139087171 edges, 260131 markings/sec, 175 secs
lola: 109885815 markings, 141272876 edges, 341133 markings/sec, 180 secs
lola: 111412944 markings, 143240336 edges, 305426 markings/sec, 185 secs
lola: 113283413 markings, 145650425 edges, 374094 markings/sec, 190 secs
lola: 114876650 markings, 147695376 edges, 318647 markings/sec, 195 secs
lola: 116765072 markings, 150123184 edges, 377684 markings/sec, 200 secs
lola: 119404231 markings, 153514189 edges, 527832 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p9)))) OR (G ((1 <= p8)) OR (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p6)
lola: processed formula length: 9
lola: 122 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: G ((1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p8))
lola: processed formula length: 13
lola: 122 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: 50005 markings, 50005 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p1) AND (1 <= p5)) OR ((1 <= p2) AND (1 <= p9))))
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: (((p1 <= 0) OR (p5 <= 0)) AND ((p2 <= 0) OR (p9 <= 0)))
lola: processed formula length: 57
lola: 124 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: 40004 markings, 40004 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no unknown no no no no unknown no no no no no
lola:
preliminary result: no yes no no unknown no no no no unknown no no no no no
lola: memory consumption: 3816 KB
lola: time consumption: 1410 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-05000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is RobotManipulation-PT-05000, 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 r208-smll-162089471000050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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