Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334700201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 CloudOpsManagement-PT-00080by00040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700201
=====================================================================

--------------------
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 86K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 28 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 CloudOpsManagement-PT-00080by00040-00
FORMULA_NAME CloudOpsManagement-PT-00080by00040-01
FORMULA_NAME CloudOpsManagement-PT-00080by00040-02
FORMULA_NAME CloudOpsManagement-PT-00080by00040-03
FORMULA_NAME CloudOpsManagement-PT-00080by00040-04
FORMULA_NAME CloudOpsManagement-PT-00080by00040-05
FORMULA_NAME CloudOpsManagement-PT-00080by00040-06
FORMULA_NAME CloudOpsManagement-PT-00080by00040-07
FORMULA_NAME CloudOpsManagement-PT-00080by00040-08
FORMULA_NAME CloudOpsManagement-PT-00080by00040-09
FORMULA_NAME CloudOpsManagement-PT-00080by00040-10
FORMULA_NAME CloudOpsManagement-PT-00080by00040-11
FORMULA_NAME CloudOpsManagement-PT-00080by00040-12
FORMULA_NAME CloudOpsManagement-PT-00080by00040-13
FORMULA_NAME CloudOpsManagement-PT-00080by00040-14
FORMULA_NAME CloudOpsManagement-PT-00080by00040-15

=== Now, execution of the tool begins

BK_START 1620902231337

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:37:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:37:15] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-13 10:37:15] [INFO ] Transformed 27 places.
[2021-05-13 10:37:15] [INFO ] Transformed 29 transitions.
[2021-05-13 10:37:15] [INFO ] Parsed PT model containing 27 places and 29 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100070 steps, including 0 resets, run finished after 124 ms. (steps per millisecond=807 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 29 rows 27 cols
[2021-05-13 10:37:16] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:37:16] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned unsat
[2021-05-13 10:37:16] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
[2021-05-13 10:37:16] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2021-05-13 10:37:16] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-13 10:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:37:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-13 10:37:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:37:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2021-05-13 10:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:37:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-13 10:37:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 10:37:16] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2021-05-13 10:37:16] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 9 ms.
[2021-05-13 10:37:16] [INFO ] Added : 25 causal constraints over 6 iterations in 73 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
[2021-05-13 10:37:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 10:37:16] [INFO ] Flatten gal took : 49 ms
FORMULA CloudOpsManagement-PT-00080by00040-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00080by00040-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00080by00040-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:37:16] [INFO ] Flatten gal took : 5 ms
[2021-05-13 10:37:16] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-13 10:37:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00080by00040 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00080by00040-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00080by00040-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2821
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00080by00040

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 10:37:17 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 295
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p21 <= p18) U (X (((p21 <= p18) OR (G ((p5 <= p18)) AND F ((p21 <= p18))))) AND F ((p3 <= p2))))",
"processed_size": 98,
"rewrites": 96
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 24
},
"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": 322
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((p6 + 1 <= p11) OR (2 <= p10))) AND X ((2 <= p10))))",
"processed_size": 61,
"rewrites": 96
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((X ((p25 <= 1)) OR F (((p0 <= p25) AND (p15 <= p8))))))",
"processed_size": 61,
"rewrites": 96
},
"result":
{
"edges": 20,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 393
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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": "G ((p14 <= 1))",
"processed_size": 14,
"rewrites": 96
},
"result":
{
"edges": 936,
"markings": 771,
"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": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p2 <= p0))))",
"processed_size": 22,
"rewrites": 96
},
"result":
{
"edges": 20,
"markings": 18,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p15 <= p26)))",
"processed_size": 20,
"rewrites": 96
},
"result":
{
"edges": 21598381,
"markings": 14162980,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 504
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p16 <= p21)",
"processed_size": 12,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((((p15 <= 1) R (p21 + 1 <= p16)) AND X (X ((p21 + 1 <= p16))))))",
"processed_size": 70,
"rewrites": 96
},
"result":
{
"edges": 71989,
"markings": 47032,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 705
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((G (F ((X ((p12 <= 0)) OR (p20 + 1 <= p6)))) OR G ((1 <= p9)))))",
"processed_size": 70,
"rewrites": 96
},
"result":
{
"edges": 80193,
"markings": 51723,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1763
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p12 + 1 <= p17) AND (p11 + 1 <= p8))",
"processed_size": 38,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3167
},
"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": "(2 <= p15)",
"processed_size": 10,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p12 + 1 <= p17) AND (p11 + 1 <= p8))",
"processed_size": 38,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p17 <= p12) OR (p8 <= p11))",
"processed_size": 30,
"rewrites": 98
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": "(2 <= p15)",
"processed_size": 10,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "G (((p15 <= 1) R F ((F ((p15 <= 1)) OR G ((p1 + 1 <= p14))))))",
"processed_size": 62,
"rewrites": 96
},
"result":
{
"edges": 242,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3572,
"runtime": 749.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((G((** OR (G(**) AND F(**)))) AND X(*)))) : (** U (X((** OR (G(**) AND F(**)))) AND F(**))) : F((F(**) AND X(**))) : X(X((X(*) OR F(**)))) : (X(X(F(**))) OR G(*)) : (G((* R F((F(*) OR G(*))))) OR **) : X(G(**)) : F(**) : (X(G(((* R *) AND X(X(**))))) OR **) : F((F(*) AND (X(*) AND G(*)))) : X(G((G(F((X(*) OR *))) OR G(**)))) : (** OR (F(**) AND F(G(*)))) : G(F((* AND (F(*) OR G(*)))))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no yes yes yes yes no no no no no no no no ",
"value": "no yes yes yes yes no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: NOT(X (X ((NOT(G ((G ((p15 <= p21)) U (p18 <= p2)))) OR X ((2 <= p1)))))) : ((p21 <= p18) U ((X (G ((p5 <= p18))) U X ((p21 <= p18))) AND F ((p3 <= p2)))) : F ((F (((p6 + 1 <= p11) OR (2 <= p10))) AND X ((2 <= p10)))) : X (X ((NOT(X ((2 <= p25))) OR NOT(G (NOT((X ((p8 + 1 <= p15)) U ((p0 <= p25) AND (p15 <= p8))))))))) : (NOT(G (X (NOT(X ((p2 <= p0)))))) OR NOT(F ((2 <= p14)))) : (G (NOT(((2 <= p15) U G ((G ((2 <= p15)) AND F ((p14 <= p1))))))) OR (2 <= p15)) : X (G ((p15 <= p26))) : (((3 <= p1) U (F (G ((1 <= p6))) OR G ((3 <= p7)))) U F ((3 <= p1))) : (X (G ((NOT(((2 <= p15) U (p16 <= p21))) AND X (X ((p21 + 1 <= p16)))))) OR (p16 <= p21)) : F (((NOT(G ((3 <= p20))) AND NOT(X ((p6 <= p2)))) AND NOT(F (F ((3 <= p20)))))) : G (X ((NOT(X (F (G ((X ((1 <= p12)) AND (p6 <= p20)))))) OR G ((1 <= p9))))) : (F (NOT(F (X ((2 <= p4))))) U ((p12 + 1 <= p17) AND (p11 + 1 <= p8))) : X (F (G (F (X (NOT(G ((G ((p25 <= p7)) U (2 <= p7)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((p18 <= p2) OR (G ((p15 <= p21)) AND F ((p18 <= p2))))) AND X ((p1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((p18 <= p2) OR (G ((p15 <= p21)) AND F ((p18 <= p2))))) AND X ((p1 <= 1)))))
lola: processed formula length: 87
lola: 96 rewrites
lola: closed formula file LTLCardinality.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: 5974343 markings, 9111136 edges, 1194869 markings/sec, 0 secs
lola: 11547204 markings, 17609439 edges, 1114572 markings/sec, 5 secs
lola: 16974867 markings, 25886352 edges, 1085533 markings/sec, 10 secs
lola: 22297492 markings, 34003083 edges, 1064525 markings/sec, 15 secs
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: 26249152 markings, 40032750 edges
lola: 26249152 markings, 40032750 edges, 790332 markings/sec, 20 secs
lola: ========================================
lola: subprocess 1 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p21 <= p18) U (X (((p21 <= p18) OR (G ((p5 <= p18)) AND F ((p21 <= p18))))) AND F ((p3 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p21 <= p18) U (X (((p21 <= p18) OR (G ((p5 <= p18)) AND F ((p21 <= p18))))) AND F ((p3 <= p2))))
lola: processed formula length: 98
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 24 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p6 + 1 <= p11) OR (2 <= p10))) AND X ((2 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p6 + 1 <= p11) OR (2 <= p10))) AND X ((2 <= p10))))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X ((p25 <= 1)) OR F (((p0 <= p25) AND (p15 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X ((p25 <= 1)) OR F (((p0 <= p25) AND (p15 <= p8))))))
lola: processed formula length: 61
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p2 <= p0)))) OR G ((p14 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p14 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p14 <= 1))
lola: processed formula length: 14
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 771 markings, 936 edges
lola: ========================================
lola: subprocess 5 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p2 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p2 <= p0))))
lola: processed formula length: 22
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p15 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p15 <= p26)))
lola: processed formula length: 20
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5651780 markings, 8619220 edges, 1130356 markings/sec, 0 secs
lola: 11012732 markings, 16794411 edges, 1072190 markings/sec, 5 secs
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: 14162980 markings, 21598381 edges
lola: ========================================
lola: subprocess 6 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((((p15 <= 1) R (p21 + 1 <= p16)) AND X (X ((p21 + 1 <= p16)))))) OR (p16 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p21)
lola: processed formula length: 12
lola: 96 rewrites
lola: closed formula file LTLCardinality.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: subprocess 7 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p15 <= 1) R (p21 + 1 <= p16)) AND X (X ((p21 + 1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p15 <= 1) R (p21 + 1 <= p16)) AND X (X ((p21 + 1 <= p16))))))
lola: processed formula length: 70
lola: 96 rewrites
lola: closed formula file LTLCardinality.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: 47032 markings, 71989 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p20 <= 2)) AND (X ((p2 + 1 <= p6)) AND G ((p20 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p20 <= 2)) AND (X ((p2 + 1 <= p6)) AND G ((p20 <= 2)))))
lola: processed formula length: 64
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 110 markings, 154 edges
lola: ========================================
lola: subprocess 8 will run for 705 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F ((X ((p12 <= 0)) OR (p20 + 1 <= p6)))) OR G ((1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F ((X ((p12 <= 0)) OR (p20 + 1 <= p6)))) OR G ((1 <= p9)))))
lola: processed formula length: 70
lola: 96 rewrites
lola: closed formula file LTLCardinality.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: 51723 markings, 80193 edges
lola: ========================================
lola: subprocess 9 will run for 881 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p1))
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 <= 2)
lola: processed formula length: 9
lola: 98 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 161 markings, 161 edges
lola: ========================================
lola: subprocess 10 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p7 <= 1) AND (F ((p7 + 1 <= p25)) OR G ((p7 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p7 <= 1) AND (F ((p7 + 1 <= p25)) OR G ((p7 <= 1))))))
lola: processed formula length: 62
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26740 markings, 54913 edges
lola: ========================================
lola: subprocess 11 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p12 + 1 <= p17) AND (p11 + 1 <= p8)) OR (F (((p12 + 1 <= p17) AND (p11 + 1 <= p8))) AND F (G ((p4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p12 + 1 <= p17) AND (p11 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p12 + 1 <= p17) AND (p11 + 1 <= p8))
lola: processed formula length: 38
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 3527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 1)))
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 ((p4 <= 1)))
lola: processed formula length: 17
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3550170 markings, 10288446 edges, 710034 markings/sec, 0 secs
lola: 6341203 markings, 19109240 edges, 558207 markings/sec, 5 secs
lola: 8966265 markings, 27481620 edges, 525012 markings/sec, 10 secs
lola: 11493368 markings, 35549788 edges, 505421 markings/sec, 15 secs
lola: 13992504 markings, 43543596 edges, 499827 markings/sec, 20 secs
lola: 16396494 markings, 51231625 edges, 480798 markings/sec, 25 secs
lola: 18715752 markings, 58651247 edges, 463852 markings/sec, 30 secs
lola: 20995130 markings, 65999511 edges, 455876 markings/sec, 35 secs
lola: 23327412 markings, 73472597 edges, 466456 markings/sec, 40 secs
lola: 25671416 markings, 80982257 edges, 468801 markings/sec, 45 secs
lola: 27972880 markings, 88413643 edges, 460293 markings/sec, 50 secs
lola: 29827035 markings, 94342193 edges, 370831 markings/sec, 55 secs
lola: 31990556 markings, 101330128 edges, 432704 markings/sec, 60 secs
lola: 34305718 markings, 108753587 edges, 463032 markings/sec, 65 secs
lola: 36529767 markings, 115946323 edges, 444810 markings/sec, 70 secs
lola: 38931503 markings, 123647304 edges, 480347 markings/sec, 75 secs
lola: 41215429 markings, 131032583 edges, 456785 markings/sec, 80 secs
lola: 43569896 markings, 138589682 edges, 470893 markings/sec, 85 secs
lola: 45867326 markings, 146026888 edges, 459486 markings/sec, 90 secs
lola: 48235973 markings, 153627825 edges, 473729 markings/sec, 95 secs
lola: 50532194 markings, 161058338 edges, 459244 markings/sec, 100 secs
lola: 52796754 markings, 168354110 edges, 452912 markings/sec, 105 secs
lola: 55163230 markings, 175996994 edges, 473295 markings/sec, 110 secs
lola: 57524846 markings, 183632501 edges, 472323 markings/sec, 115 secs
lola: 59913502 markings, 191318781 edges, 477731 markings/sec, 120 secs
lola: 62220415 markings, 198785207 edges, 461383 markings/sec, 125 secs
lola: 64527931 markings, 206212109 edges, 461503 markings/sec, 130 secs
lola: 66858784 markings, 213770203 edges, 466171 markings/sec, 135 secs
lola: 69156434 markings, 221161003 edges, 459530 markings/sec, 140 secs
lola: 71479533 markings, 228700054 edges, 464620 markings/sec, 145 secs
lola: 73742567 markings, 236195985 edges, 452607 markings/sec, 150 secs
lola: 75913936 markings, 243718760 edges, 434274 markings/sec, 155 secs
lola: 78522044 markings, 252039088 edges, 521622 markings/sec, 160 secs
lola: 81828084 markings, 261825761 edges, 661208 markings/sec, 165 secs
lola: 84696874 markings, 270909750 edges, 573758 markings/sec, 170 secs
lola: 87405953 markings, 279559632 edges, 541816 markings/sec, 175 secs
lola: 90043949 markings, 287990093 edges, 527599 markings/sec, 180 secs
lola: 92646135 markings, 296320638 edges, 520437 markings/sec, 185 secs
lola: 95207928 markings, 304521393 edges, 512359 markings/sec, 190 secs
lola: 97706138 markings, 312522795 edges, 499642 markings/sec, 195 secs
lola: 100181447 markings, 320495596 edges, 495062 markings/sec, 200 secs
lola: 102678380 markings, 328511149 edges, 499387 markings/sec, 205 secs
lola: 105121409 markings, 336343977 edges, 488606 markings/sec, 210 secs
lola: 107575948 markings, 344267640 edges, 490908 markings/sec, 215 secs
lola: 110025216 markings, 352127295 edges, 489854 markings/sec, 220 secs
lola: 112413537 markings, 359821767 edges, 477664 markings/sec, 225 secs
lola: 114853509 markings, 367679560 edges, 487994 markings/sec, 230 secs
lola: 117259534 markings, 375419744 edges, 481205 markings/sec, 235 secs
lola: 119696226 markings, 383276822 edges, 487338 markings/sec, 240 secs
lola: 121523306 markings, 389170216 edges, 365416 markings/sec, 245 secs
lola: 122464410 markings, 392172869 edges, 188221 markings/sec, 250 secs
lola: 123269222 markings, 394776439 edges, 160962 markings/sec, 255 secs
lola: 123666218 markings, 396064776 edges, 79399 markings/sec, 260 secs
lola: 124115668 markings, 397519214 edges, 89890 markings/sec, 265 secs
lola: 124767275 markings, 399627874 edges, 130321 markings/sec, 270 secs
lola: 125576870 markings, 402244950 edges, 161919 markings/sec, 275 secs
lola: 126119136 markings, 403995072 edges, 108453 markings/sec, 280 secs
lola: 127378558 markings, 408015029 edges, 251884 markings/sec, 285 secs
lola: 129303123 markings, 414245511 edges, 384913 markings/sec, 290 secs
lola: 131190707 markings, 420345763 edges, 377517 markings/sec, 295 secs
lola: 133119389 markings, 426540741 edges, 385736 markings/sec, 300 secs
lola: 135050162 markings, 432798109 edges, 386155 markings/sec, 305 secs
lola: 136772192 markings, 438362896 edges, 344406 markings/sec, 310 secs
lola: 138665808 markings, 444444677 edges, 378723 markings/sec, 315 secs
lola: 140218200 markings, 449474445 edges, 310478 markings/sec, 320 secs
lola: 141376002 markings, 453221153 edges, 231560 markings/sec, 325 secs
lola: 142266637 markings, 456090981 edges, 178127 markings/sec, 330 secs
lola: 143453399 markings, 459902958 edges, 237352 markings/sec, 335 secs
lola: 145254096 markings, 465745856 edges, 360139 markings/sec, 340 secs
lola: 147164409 markings, 471927333 edges, 382063 markings/sec, 345 secs
lola: 149125291 markings, 478240966 edges, 392176 markings/sec, 350 secs
lola: Child process aborted or communication problem between parent and child process
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 3167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p15 <= 1) R F ((F ((p15 <= 1)) OR G ((p1 + 1 <= p14)))))) OR (2 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3167 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p15)
lola: processed formula length: 10
lola: 96 rewrites
lola: closed formula file LTLCardinality.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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p12 + 1 <= p17) AND (p11 + 1 <= p8)) OR (F (((p12 + 1 <= p17) AND (p11 + 1 <= p8))) AND F (G ((p4 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p12 + 1 <= p17) AND (p11 + 1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p12 + 1 <= p17) AND (p11 + 1 <= p8))
lola: processed formula length: 38
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: F (G ((p4 <= 1)))
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 ((p4 <= 1)))
lola: processed formula length: 17
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: ========================================
lola: 3411235 markings, 9846306 edges, 682247 markings/sec, 0 secs
lola: 6165397 markings, 18544356 edges, 550832 markings/sec, 5 secs
lola: 8678047 markings, 26556028 edges, 502530 markings/sec, 10 secs
lola: 11120436 markings, 34351548 edges, 488478 markings/sec, 15 secs
lola: 13458425 markings, 41823276 edges, 467598 markings/sec, 20 secs
lola: 15717584 markings, 49042843 edges, 451832 markings/sec, 25 secs
lola: 17948112 markings, 56220257 edges, 446106 markings/sec, 30 secs
lola: 20225114 markings, 63521656 edges, 455400 markings/sec, 35 secs
lola: 22511585 markings, 70838332 edges, 457294 markings/sec, 40 secs
lola: 24767882 markings, 78111558 edges, 451259 markings/sec, 45 secs
lola: 27122254 markings, 85667676 edges, 470874 markings/sec, 50 secs
lola: 29325313 markings, 92758896 edges, 440612 markings/sec, 55 secs
lola: 31716465 markings, 100444995 edges, 478230 markings/sec, 60 secs
lola: 33800867 markings, 107139018 edges, 416880 markings/sec, 65 secs
lola: 35884375 markings, 113860316 edges, 416702 markings/sec, 70 secs
lola: 38102290 markings, 121004456 edges, 443583 markings/sec, 75 secs
lola: 40444445 markings, 128541053 edges, 468431 markings/sec, 80 secs
lola: 42698816 markings, 135807533 edges, 450874 markings/sec, 85 secs
lola: 45078207 markings, 143474044 edges, 475878 markings/sec, 90 secs
lola: 47363470 markings, 150854470 edges, 457053 markings/sec, 95 secs
lola: 49753345 markings, 158538325 edges, 477975 markings/sec, 100 secs
lola: 51984653 markings, 165753115 edges, 446262 markings/sec, 105 secs
lola: 54321230 markings, 173267066 edges, 467315 markings/sec, 110 secs
lola: 56672820 markings, 180882331 edges, 470318 markings/sec, 115 secs
lola: 59020258 markings, 188422425 edges, 469488 markings/sec, 120 secs
lola: 61473891 markings, 196370615 edges, 490727 markings/sec, 125 secs
lola: 63789567 markings, 203818590 edges, 463135 markings/sec, 130 secs
lola: 66076368 markings, 211235303 edges, 457360 markings/sec, 135 secs
lola: 68416509 markings, 218791852 edges, 468028 markings/sec, 140 secs
lola: 70825810 markings, 226580206 edges, 481860 markings/sec, 145 secs
lola: 72500386 markings, 232006173 edges, 334915 markings/sec, 150 secs
lola: 74405552 markings, 238691407 edges, 381033 markings/sec, 155 secs
lola: 76518316 markings, 245723739 edges, 422553 markings/sec, 160 secs
lola: 79299044 markings, 254263604 edges, 556146 markings/sec, 165 secs
lola: 82366503 markings, 263507585 edges, 613492 markings/sec, 170 secs
lola: 84988222 markings, 271843882 edges, 524344 markings/sec, 175 secs
lola: 87409260 markings, 279570358 edges, 484208 markings/sec, 180 secs
lola: 89738232 markings, 287007654 edges, 465794 markings/sec, 185 secs
lola: 92124010 markings, 294640386 edges, 477156 markings/sec, 190 secs
lola: 94377449 markings, 301844329 edges, 450688 markings/sec, 195 secs
lola: 96576417 markings, 308920415 edges, 439794 markings/sec, 200 secs
lola: 98837410 markings, 316175164 edges, 452199 markings/sec, 205 secs
lola: 101022214 markings, 323165791 edges, 436961 markings/sec, 210 secs
lola: 103076560 markings, 329794119 edges, 410869 markings/sec, 215 secs
lola: 105168325 markings, 336495204 edges, 418353 markings/sec, 220 secs
lola: 107228032 markings, 343147834 edges, 411941 markings/sec, 225 secs
lola: 109270254 markings, 349687050 edges, 408444 markings/sec, 230 secs
lola: 111286920 markings, 356201592 edges, 403333 markings/sec, 235 secs
lola: 113309161 markings, 362682545 edges, 404448 markings/sec, 240 secs
lola: 115334470 markings, 369233822 edges, 405062 markings/sec, 245 secs
lola: 117303697 markings, 375559018 edges, 393845 markings/sec, 250 secs
lola: 119314008 markings, 382041185 edges, 402062 markings/sec, 255 secs
lola: 121250579 markings, 388294122 edges, 387314 markings/sec, 260 secs
lola: 123153979 markings, 394404573 edges, 380680 markings/sec, 265 secs
lola: 124997809 markings, 400373870 edges, 368766 markings/sec, 270 secs
lola: 126909521 markings, 406531194 edges, 382342 markings/sec, 275 secs
lola: 128750126 markings, 412454905 edges, 368121 markings/sec, 280 secs
lola: 130582320 markings, 418381892 edges, 366439 markings/sec, 285 secs
lola: 132506565 markings, 424557424 edges, 384849 markings/sec, 290 secs
lola: 134402603 markings, 430701285 edges, 379208 markings/sec, 295 secs
lola: 136251348 markings, 436682832 edges, 369749 markings/sec, 300 secs
lola: 138206348 markings, 442956117 edges, 391000 markings/sec, 305 secs
lola: 140115582 markings, 449142001 edges, 381847 markings/sec, 310 secs
lola: 141979731 markings, 455169241 edges, 372830 markings/sec, 315 secs
lola: 143898240 markings, 461345522 edges, 383702 markings/sec, 320 secs
lola: 145755358 markings, 467369813 edges, 371424 markings/sec, 325 secs
lola: 147659560 markings, 473515802 edges, 380840 markings/sec, 330 secs
lola: 149593133 markings, 479761600 edges, 386715 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (((p12 + 1 <= p17) AND (p11 + 1 <= p8)))
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: ((p17 <= p12) OR (p8 <= p11))
lola: processed formula length: 30
lola: 98 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 42 markings, 42 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((p15 <= 1) R F ((F ((p15 <= 1)) OR G ((p1 + 1 <= p14)))))) OR (2 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p15)
lola: processed formula length: 10
lola: 96 rewrites
lola: closed formula file LTLCardinality.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 (((p15 <= 1) R F ((F ((p15 <= 1)) OR G ((p1 + 1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p15 <= 1) R F ((F ((p15 <= 1)) OR G ((p1 + 1 <= p14))))))
lola: processed formula length: 62
lola: 96 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 206 markings, 242 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no no no no no no no
lola:
preliminary result: no yes yes yes yes no no no no no no no no
lola: ========================================
lola: memory consumption: 3572 KB
lola: time consumption: 749 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00080by00040"
export BK_EXAMINATION="LTLCardinality"
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 CloudOpsManagement-PT-00080by00040, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-oct2-162038334700201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00080by00040.tgz
mv CloudOpsManagement-PT-00080by00040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;