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.r094-tall-162048902800418.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is FMS-PT-50000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902800418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 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 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 FMS-PT-50000-00
FORMULA_NAME FMS-PT-50000-01
FORMULA_NAME FMS-PT-50000-02
FORMULA_NAME FMS-PT-50000-03
FORMULA_NAME FMS-PT-50000-04
FORMULA_NAME FMS-PT-50000-05
FORMULA_NAME FMS-PT-50000-06
FORMULA_NAME FMS-PT-50000-07
FORMULA_NAME FMS-PT-50000-08
FORMULA_NAME FMS-PT-50000-09
FORMULA_NAME FMS-PT-50000-10
FORMULA_NAME FMS-PT-50000-11
FORMULA_NAME FMS-PT-50000-12
FORMULA_NAME FMS-PT-50000-13
FORMULA_NAME FMS-PT-50000-14
FORMULA_NAME FMS-PT-50000-15

=== Now, execution of the tool begins

BK_START 1620783462153

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

FORMULA FMS-PT-50000-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3059
rslt: Output for LTLFireability @ FMS-PT-50000

{
"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": "Wed May 12 01:37:46 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 <= p9))",
"processed_size": 13,
"rewrites": 109
},
"result":
{
"edges": 1199991,
"markings": 1099992,
"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": 274
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p0 <= 0) OR (1 <= p3)))",
"processed_size": 28,
"rewrites": 109
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (G (((1 <= p10) AND (1 <= p17)))) OR (G (((1 <= p10) AND (1 <= p17))) AND F (G (((1 <= p10) AND (1 <= p17)))))))",
"processed_size": 118,
"rewrites": 109
},
"result":
{
"edges": 200003,
"markings": 200003,
"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": 297
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (X (((F ((p4 <= 0)) AND (p11 <= 0)) U X ((1 <= p4))))))",
"processed_size": 60,
"rewrites": 109
},
"result":
{
"edges": 275,
"markings": 147,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((X ((G ((p14 <= 0)) OR X ((1 <= p19)))) AND ((p10 <= 0) OR (p17 <= 0)))))",
"processed_size": 80,
"rewrites": 109
},
"result":
{
"edges": 209635974,
"markings": 78178792,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"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": "(p16 <= 0)",
"processed_size": 10,
"rewrites": 111
},
"result":
{
"edges": 300012,
"markings": 300012,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"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 <= p0)",
"processed_size": 9,
"rewrites": 109
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (((1 <= p16))) U (1 <= p0))",
"processed_size": 30,
"rewrites": 109
},
"result":
{
"edges": 200003,
"markings": 200003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 538
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((X (F ((1 <= p1))) OR (p19 <= 0)) R (p1 <= 0)))",
"processed_size": 51,
"rewrites": 109
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 645
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": "G (F (((p12 <= 0) R X (X (X (((p5 <= 0) OR (p7 <= 0))))))))",
"processed_size": 60,
"rewrites": 109
},
"result":
{
"edges": 200007,
"markings": 200007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 807
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F ((1 <= p16)) AND ((X (X (((p13 <= 0) OR (p15 <= 0)))) AND (p11 <= 0)) OR (1 <= p16))))",
"processed_size": 93,
"rewrites": 109
},
"result":
{
"edges": 300008,
"markings": 300008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 1076
},
"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 ((p20 <= 0)))",
"processed_size": 18,
"rewrites": 109
},
"result":
{
"edges": 250014,
"markings": 250013,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1614
},
"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 <= p2) AND (1 <= p18))))",
"processed_size": 34,
"rewrites": 109
},
"result":
{
"edges": 250002,
"markings": 250002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 3228
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 3,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G (((1 <= p2) AND (1 <= p18))) OR (F (G (((1 <= p2) AND (1 <= p18)))) AND F (G ((F (((1 <= p2) AND (1 <= p18))) AND (F ((1 <= p12)) OR ((p1 <= 0) OR ((1 <= p2) AND (1 <= p18))))))))))",
"processed_size": 187,
"rewrites": 109
},
"result":
{
"edges": 250004,
"markings": 250003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 511.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F((G(**) OR (F(G(**)) AND F(G((F(**) AND (F(**) OR (** OR **)))))))) : (X((** OR **)) OR (F(**) AND G(**))) : G((X(G(*)) OR (G(**) AND F(G(*))))) : ((X(G(**)) U **) OR G(*)) : G(F(**)) : X(X(X(((F(*) AND *) U X(**))))) : F(G((X((G(*) OR X(**))) AND *))) : (X(**) AND F(**)) : ((X(**) U **) OR ((** U X(X(G(**)))) AND **)) : F(G((F(**) AND (X(G(**)) OR (** OR **))))) : X(((X(F(**)) OR *) R *)) : F(G(*)) : G(F((* R X(X(X(*)))))) : G((F(**) AND ((X(X(*)) AND **) OR **)))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no yes no no no yes no no no unknown yes no no no ",
"value": "no yes no no no yes no no no unknown yes 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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 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 LTLFireability.xml
lola: F ((F (G (((F ((1 <= p12)) OR (p1 <= 0)) U ((1 <= p2) AND (1 <= p18))))) U G (((1 <= p2) AND (1 <= p18))))) : ((X ((p0 <= 0)) OR X ((1 <= p3))) OR (F ((1 <= p0)) AND G ((1 <= p9)))) : G ((G (((1 <= p10) AND (1 <= p17))) U G (X (G (NOT(F (((p10 <= 0) OR (p17 <= 0))))))))) : ((G (X ((1 <= p19))) U (1 <= p0)) OR NOT(F (((1 <= p0) AND ((p5 <= 0) OR (p7 <= 0)))))) : (((1 <= p11) AND (1 <= p2) AND (1 <= p18)) U F (G (X (F (X (((1 <= p2) AND (1 <= p18)))))))) : X ((X (NOT(X ((G ((1 <= p4)) OR (1 <= p11))))) U X (X (X ((1 <= p4)))))) : F (G (X (NOT(X ((NOT(X ((NOT(F ((1 <= p14))) OR X ((1 <= p19))))) OR ((1 <= p10) AND (1 <= p17)))))))) : (X (((1 <= p2) AND (1 <= p18))) AND F ((1 <= p16))) : ((X (((1 <= p16))) U (1 <= p0)) OR (((1 <= p16) U X (X (G ((1 <= p0))))) AND (1 <= p0))) : F (NOT(F (NOT(F (X (G (((X (G ((1 <= p0))) OR (1 <= p0)) U (p0 <= 0))))))))) : NOT(X (((NOT(F (X ((1 <= p1)))) AND (1 <= p19)) U (1 <= p1)))) : F (NOT(F ((1 <= p20)))) : G (F (NOT(((1 <= p12) U X (X (X (((1 <= p5) AND (1 <= p7))))))))) : G (((NOT(X (X (((1 <= p13) AND (1 <= p15))))) AND (p11 <= 0)) U (1 <= p16)))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: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:338
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p0 <= 0) OR (1 <= p3))) OR (F ((1 <= p0)) AND G ((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p9))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p9))
lola: processed formula length: 13
lola: 109 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: 1099992 markings, 1199991 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= 0) OR (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= 0) OR (1 <= p3)))
lola: processed formula length: 28
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((1 <= p10) AND (1 <= p17)))) OR (G (((1 <= p10) AND (1 <= p17))) AND F (G (((1 <= p10) AND (1 <= p17)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((1 <= p10) AND (1 <= p17)))) OR (G (((1 <= p10) AND (1 <= p17))) AND F (G (((1 <= p10) AND (1 <= p17)))))))
lola: processed formula length: 118
lola: 109 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: 200003 markings, 200003 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G ((1 <= p19))) U (1 <= p0)) OR G (((p0 <= 0) OR ((1 <= p5) AND (1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p0 <= 0) OR ((1 <= p5) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p0 <= 0) OR ((1 <= p5) AND (1 <= p7))))
lola: processed formula length: 45
lola: 109 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: 1799986 markings, 2299977 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p19))) U (1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((1 <= p19))) U (1 <= p0))
lola: processed formula length: 32
lola: 109 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: 200003 markings, 200003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (((F ((p4 <= 0)) AND (p11 <= 0)) U X ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (((F ((p4 <= 0)) AND (p11 <= 0)) U X ((1 <= p4))))))
lola: processed formula length: 60
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 147 markings, 275 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((G ((p14 <= 0)) OR X ((1 <= p19)))) AND ((p10 <= 0) OR (p17 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((G ((p14 <= 0)) OR X ((1 <= p19)))) AND ((p10 <= 0) OR (p17 <= 0)))))
lola: processed formula length: 80
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3010583 markings, 6787981 edges, 602117 markings/sec, 0 secs
lola: 5741409 markings, 13189035 edges, 546165 markings/sec, 5 secs
lola: 8634102 markings, 20959530 edges, 578539 markings/sec, 10 secs
lola: 11551810 markings, 29121103 edges, 583542 markings/sec, 15 secs
lola: 14493371 markings, 37349470 edges, 588312 markings/sec, 20 secs
lola: 17451079 markings, 45623012 edges, 591542 markings/sec, 25 secs
lola: 20386000 markings, 53832788 edges, 586984 markings/sec, 30 secs
lola: 23398093 markings, 62258487 edges, 602419 markings/sec, 35 secs
lola: 26442659 markings, 70774955 edges, 608913 markings/sec, 40 secs
lola: 29097229 markings, 77925720 edges, 530914 markings/sec, 45 secs
lola: 31581524 markings, 84592354 edges, 496859 markings/sec, 50 secs
lola: 34020087 markings, 91136192 edges, 487713 markings/sec, 55 secs
lola: 36435661 markings, 97618356 edges, 483115 markings/sec, 60 secs
lola: 38807546 markings, 103983316 edges, 474377 markings/sec, 65 secs
lola: 41167110 markings, 110315212 edges, 471913 markings/sec, 70 secs
lola: 43503986 markings, 116586194 edges, 467375 markings/sec, 75 secs
lola: 45859857 markings, 122908158 edges, 471174 markings/sec, 80 secs
lola: 48182245 markings, 129140276 edges, 464478 markings/sec, 85 secs
lola: 50491537 markings, 135337255 edges, 461858 markings/sec, 90 secs
lola: 52794471 markings, 141517164 edges, 460587 markings/sec, 95 secs
lola: 55091646 markings, 147681614 edges, 459435 markings/sec, 100 secs
lola: 57374776 markings, 153808409 edges, 456626 markings/sec, 105 secs
lola: 59637660 markings, 159880829 edges, 452577 markings/sec, 110 secs
lola: 61924277 markings, 166016966 edges, 457323 markings/sec, 115 secs
lola: 64202954 markings, 172131751 edges, 455735 markings/sec, 120 secs
lola: 66458582 markings, 178184750 edges, 451126 markings/sec, 125 secs
lola: 68695808 markings, 184188299 edges, 447445 markings/sec, 130 secs
lola: 70946605 markings, 190228330 edges, 450159 markings/sec, 135 secs
lola: 73172727 markings, 196202104 edges, 445224 markings/sec, 140 secs
lola: 75396377 markings, 202169276 edges, 444730 markings/sec, 145 secs
lola: 77617792 markings, 208130446 edges, 444283 markings/sec, 150 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: 78178792 markings, 209635974 edges
lola: 78178792 markings, 209635974 edges, 112200 markings/sec, 155 secs
lola: ========================================
lola: subprocess 5 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p2) AND (1 <= p18))) AND F ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p16))
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: (p16 <= 0)
lola: processed formula length: 10
lola: 111 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: 300012 markings, 300012 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p16))) U (1 <= p0)) OR (((1 <= p16) U X (X (G ((1 <= p0))))) AND (1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 109 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: subprocess 7 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p16))) U (1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((1 <= p16))) U (1 <= p0))
lola: processed formula length: 30
lola: 109 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: 200003 markings, 200003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 <= 0)) AND (X (G ((1 <= p0))) OR ((1 <= p0) OR (p0 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 <= 0)) AND (X (G ((1 <= p0))) OR ((1 <= p0) OR (p0 <= 0))))))
lola: processed formula length: 75
lola: 109 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: 4765604 markings, 6298363 edges, 953121 markings/sec, 0 secs
lola: 9297802 markings, 12346614 edges, 906440 markings/sec, 5 secs
lola: 13792722 markings, 18338948 edges, 898984 markings/sec, 10 secs
lola: 18238893 markings, 24258161 edges, 889234 markings/sec, 15 secs
lola: 22689317 markings, 30189468 edges, 890085 markings/sec, 20 secs
lola: 27096449 markings, 36069406 edges, 881426 markings/sec, 25 secs
lola: 31482024 markings, 41922725 edges, 877115 markings/sec, 30 secs
lola: 35827759 markings, 47716285 edges, 869147 markings/sec, 35 secs
lola: 40196304 markings, 53544056 edges, 873709 markings/sec, 40 secs
lola: 44544523 markings, 59341342 edges, 869644 markings/sec, 45 secs
lola: 48891567 markings, 65136864 edges, 869409 markings/sec, 50 secs
lola: 53200017 markings, 70874496 edges, 861690 markings/sec, 55 secs
lola: 57474053 markings, 76574437 edges, 854807 markings/sec, 60 secs
lola: 61803272 markings, 82353684 edges, 865844 markings/sec, 65 secs
lola: 66103352 markings, 88079370 edges, 860016 markings/sec, 70 secs
lola: 70396323 markings, 93796793 edges, 858594 markings/sec, 75 secs
lola: 74647024 markings, 99469791 edges, 850140 markings/sec, 80 secs
lola: 78944583 markings, 105195110 edges, 859512 markings/sec, 85 secs
lola: 83152603 markings, 110803158 edges, 841604 markings/sec, 90 secs
lola: 87325631 markings, 116376214 edges, 834606 markings/sec, 95 secs
lola: 91413854 markings, 121820344 edges, 817645 markings/sec, 100 secs
lola: 93535334 markings, 124653476 edges, 424296 markings/sec, 105 secs
lola: 95621735 markings, 127431647 edges, 417280 markings/sec, 110 secs
lola: 97882113 markings, 130448418 edges, 452076 markings/sec, 115 secs
lola: 100812749 markings, 134363971 edges, 586127 markings/sec, 120 secs
lola: 102429292 markings, 136517916 edges, 323309 markings/sec, 125 secs
lola: 103834451 markings, 138385142 edges, 281032 markings/sec, 130 secs
lola: 106157133 markings, 141484642 edges, 464536 markings/sec, 135 secs
lola: 108397547 markings, 144470237 edges, 448083 markings/sec, 140 secs
lola: 109651320 markings, 146150886 edges, 250755 markings/sec, 145 secs
lola: 112200481 markings, 149549602 edges, 509832 markings/sec, 150 secs
lola: 113086598 markings, 150728769 edges, 177223 markings/sec, 155 secs
lola: 113454714 markings, 151205937 edges, 73623 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 538 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F ((1 <= p1))) OR (p19 <= 0)) R (p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F ((1 <= p1))) OR (p19 <= 0)) R (p1 <= 0)))
lola: processed formula length: 51
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 9 will run for 645 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p12 <= 0) R X (X (X (((p5 <= 0) OR (p7 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p12 <= 0) R X (X (X (((p5 <= 0) OR (p7 <= 0))))))))
lola: processed formula length: 60
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 200007 markings, 200007 edges
lola: ========================================
lola: subprocess 10 will run for 807 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p16)) AND ((X (X (((p13 <= 0) OR (p15 <= 0)))) AND (p11 <= 0)) OR (1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p16)) AND ((X (X (((p13 <= 0) OR (p15 <= 0)))) AND (p11 <= 0)) OR (1 <= p16))))
lola: processed formula length: 93
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 300008 markings, 300008 edges
lola: ========================================
lola: subprocess 11 will run for 1076 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p20 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p20 <= 0)))
lola: processed formula length: 18
lola: 109 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: 250013 markings, 250014 edges
lola: ========================================
lola: subprocess 12 will run for 1614 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p2) AND (1 <= p18))))
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 <= p2) AND (1 <= p18))))
lola: processed formula length: 34
lola: 109 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: 250002 markings, 250002 edges
lola: ========================================
lola: subprocess 13 will run for 3228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p2) AND (1 <= p18))) OR (F (G (((1 <= p2) AND (1 <= p18)))) AND F (G ((F (((1 <= p2) AND (1 <= p18))) AND (F ((1 <= p12)) OR ((p1 <= 0) OR ((1 <= p2) AND (1 <= p18))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p2) AND (1 <= p18))) OR (F (G (((1 <= p2) AND (1 <= p18)))) AND F (G ((F (((1 <= p2) AND (1 <= p18))) AND (F ((1 <= p12)) OR ((p1 <= 0) OR ((1 <= p2) AND (1 <= p18))))))))))
lola: processed formula length: 187
lola: 109 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 250003 markings, 250004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p0 <= 0)) AND (X (G ((1 <= p0))) OR ((1 <= p0) OR (p0 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p0 <= 0)) AND (X (G ((1 <= p0))) OR ((1 <= p0) OR (p0 <= 0))))))
lola: processed formula length: 75
lola: 109 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: 4760859 markings, 6291243 edges, 952172 markings/sec, 0 secs
lola: 9281843 markings, 12322673 edges, 904197 markings/sec, 5 secs
lola: 13774542 markings, 18311680 edges, 898540 markings/sec, 10 secs
lola: 20807891 markings, 27686633 edges, 1406670 markings/sec, 15 secs
lola: 25235601 markings, 33585771 edges, 885542 markings/sec, 20 secs
lola: 29624964 markings, 39437151 edges, 877873 markings/sec, 25 secs
lola: 35543402 markings, 47339749 edges, 1183688 markings/sec, 30 secs
lola: 39912230 markings, 53162499 edges, 873766 markings/sec, 35 secs
lola: 44262341 markings, 58962636 edges, 870022 markings/sec, 40 secs
lola: 48606192 markings, 64756518 edges, 868770 markings/sec, 45 secs
lola: 52908239 markings, 70486834 edges, 860409 markings/sec, 50 secs
lola: 57190822 markings, 76191203 edges, 856517 markings/sec, 55 secs
lola: 61505326 markings, 81955736 edges, 862901 markings/sec, 60 secs
lola: 65801241 markings, 87676207 edges, 859183 markings/sec, 65 secs
lola: 70080585 markings, 93381054 edges, 855869 markings/sec, 70 secs
lola: 74333794 markings, 99049952 edges, 850642 markings/sec, 75 secs
lola: 78606968 markings, 104757494 edges, 854635 markings/sec, 80 secs
lola: 82874705 markings, 110436230 edges, 853547 markings/sec, 85 secs
lola: 87087553 markings, 116055464 edges, 842570 markings/sec, 90 secs
lola: 91317523 markings, 121700375 edges, 845994 markings/sec, 95 secs
lola: 94771924 markings, 126307195 edges, 690880 markings/sec, 100 secs
lola: 95653994 markings, 127480035 edges, 176414 markings/sec, 105 secs
lola: 97764822 markings, 130296258 edges, 422166 markings/sec, 110 secs
lola: 99468848 markings, 132569511 edges, 340805 markings/sec, 115 secs
lola: 102252337 markings, 136277485 edges, 556698 markings/sec, 120 secs
lola: 103977594 markings, 138578286 edges, 345051 markings/sec, 125 secs
lola: 106370727 markings, 141771436 edges, 478627 markings/sec, 130 secs
lola: 108104539 markings, 144080730 edges, 346762 markings/sec, 135 secs
lola: 110751053 markings, 147601792 edges, 529303 markings/sec, 140 secs
lola: 112147711 markings, 149470447 edges, 279332 markings/sec, 145 secs
lola: 113291449 markings, 150992203 edges, 228748 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no no no yes no no no unknown yes no no no
lola:
preliminary result: no yes no no no yes no no no unknown yes no no no
lola: memory consumption: 3372 KB
lola: time consumption: 511 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="FMS-PT-50000"
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 FMS-PT-50000, 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 r094-tall-162048902800418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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