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-162048902300069.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 Diffusion2D-PT-D30N010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902300069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 21K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 116K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 22 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 Diffusion2D-PT-D30N010-00
FORMULA_NAME Diffusion2D-PT-D30N010-01
FORMULA_NAME Diffusion2D-PT-D30N010-02
FORMULA_NAME Diffusion2D-PT-D30N010-03
FORMULA_NAME Diffusion2D-PT-D30N010-04
FORMULA_NAME Diffusion2D-PT-D30N010-05
FORMULA_NAME Diffusion2D-PT-D30N010-06
FORMULA_NAME Diffusion2D-PT-D30N010-07
FORMULA_NAME Diffusion2D-PT-D30N010-08
FORMULA_NAME Diffusion2D-PT-D30N010-09
FORMULA_NAME Diffusion2D-PT-D30N010-10
FORMULA_NAME Diffusion2D-PT-D30N010-11
FORMULA_NAME Diffusion2D-PT-D30N010-12
FORMULA_NAME Diffusion2D-PT-D30N010-13
FORMULA_NAME Diffusion2D-PT-D30N010-14
FORMULA_NAME Diffusion2D-PT-D30N010-15

=== Now, execution of the tool begins

BK_START 1620729454228

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 10:37:35] [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-11 10:37:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 10:37:36] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2021-05-11 10:37:36] [INFO ] Transformed 900 places.
[2021-05-11 10:37:36] [INFO ] Transformed 6844 transitions.
[2021-05-11 10:37:36] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 331 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 493 ms. (steps per millisecond=202 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 6844 rows 900 cols
[2021-05-11 10:37:36] [INFO ] Computed 1 place invariants in 68 ms
[2021-05-11 10:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned unsat
[2021-05-11 10:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
[2021-05-11 10:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
[2021-05-11 10:37:37] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-11 10:37:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-11 10:37:37] [INFO ] Flatten gal took : 312 ms
FORMULA Diffusion2D-PT-D30N010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 10:37:38] [INFO ] Flatten gal took : 173 ms
[2021-05-11 10:37:38] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 10:37:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 42 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Diffusion2D-PT-D30N010 @ 3570 seconds

FORMULA Diffusion2D-PT-D30N010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Diffusion2D-PT-D30N010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2685
rslt: Output for LTLCardinality @ Diffusion2D-PT-D30N010

{
"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": "Tue May 11 10:37:41 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 354
},
"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": "(p53 <= p724)",
"processed_size": 13,
"rewrites": 44
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 (F ((p176 + 1 <= p857)))",
"processed_size": 26,
"rewrites": 44
},
"result":
{
"edges": 151,
"markings": 151,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 399
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X (X ((X ((3 <= p459)) OR (p34 + 1 <= p466)))) U G (((p459 <= 2) AND (p694 + 1 <= p738))))",
"processed_size": 91,
"rewrites": 44
},
"result":
{
"edges": 151,
"markings": 151,
"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": 456
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((X ((p234 <= p227)) AND (p618 + 1 <= p225)))",
"processed_size": 47,
"rewrites": 44
},
"result":
{
"edges": 302,
"markings": 301,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 532
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X ((F ((p806 <= p715)) AND (p395 <= p431))))",
"processed_size": 47,
"rewrites": 44
},
"result":
{
"edges": 264,
"markings": 131,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 798
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p85 <= p217)))",
"processed_size": 21,
"rewrites": 44
},
"result":
{
"edges": 62273,
"markings": 20792,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1064
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p129 <= p518))",
"processed_size": 18,
"rewrites": 44
},
"result":
{
"edges": 18118,
"markings": 7978,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 1596
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((F (G ((3 <= p242))) AND (p109 + 1 <= p323))))",
"processed_size": 52,
"rewrites": 44
},
"result":
{
"edges": 60,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3192
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3192
},
"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": "(p20 + 1 <= p267)",
"processed_size": 17,
"rewrites": 44
},
"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"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((G (F (((p351 <= p798)))) AND X (X ((p351 <= p798)))))",
"processed_size": 57,
"rewrites": 44
},
"result":
{
"edges": 35381561,
"markings": 8365509,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p20 + 1 <= p267)",
"processed_size": 17,
"rewrites": 44
},
"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": 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": "(p267 <= p20)",
"processed_size": 13,
"rewrites": 46
},
"result":
{
"edges": 192,
"markings": 192,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 32
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 70848,
"runtime": 885.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(**) OR (G(F((G(*) OR (X(*) AND *)))) AND X(F(**)))) : (X(F(**)) OR G(**)) : X((G(F(**)) AND X(X(**)))) : (X(F(*)) AND (G(**) OR **)) : G(F((F(G(**)) AND **))) : (X(X((X(**) OR **))) U G(*)) : G(**) : F((X(**) AND **)) : F(G(**)) : X(X((F(**) AND **))) : (F(*) OR **) : (X(F((** OR (G(**) AND F(**))))) AND G(F(**)))"
},
"net":
{
"arcs": 13688,
"conflict_clusters": 900,
"places": 900,
"places_significant": 899,
"singleton_clusters": 0,
"transitions": 6844
},
"result":
{
"preliminary_value": "no no no no no no no no no yes no no ",
"value": "no no no no no no no no no yes 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: 7744/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 28800
lola: finding significant places
lola: 900 places, 6844 transitions, 899 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: (X (NOT(F (G ((X ((2 <= p33)) U (2 <= p835)))))) U X ((2 <= p33))) : (F (((3 <= p837) U X ((1 <= p262)))) OR G (((p604 + 1 <= p477) AND (p837 <= 2)))) : X ((G (NOT(F (NOT(F (((p351 <= p798))))))) AND X (X ((p351 <= p798))))) : (NOT(X (G ((p857 <= p176)))) AND (G ((p724 + 1 <= p53)) OR (p53 <= p724))) : X (X (G (F (((2 <= p349) U (F (G ((3 <= p242))) AND (p109 + 1 <= p323))))))) : (X (X ((X ((3 <= p459)) OR (p34 + 1 <= p466)))) U NOT(F (((3 <= p459) OR (p738 <= p694))))) : G ((p129 <= p518)) : F ((X ((p234 <= p227)) AND (p618 + 1 <= p225))) : G (F (G ((p85 <= p217)))) : X ((NOT(X (NOT(((0 <= 0) U F ((p806 <= p715)))))) AND X ((p395 <= p431)))) : (NOT(G ((p267 <= p20))) OR (p20 + 1 <= p267)) : (F (X ((G (((1 <= p458))) U (1 <= p458)))) AND G (F ((3 <= p804))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((2 <= p33)) OR (G (F ((G ((p835 <= 1)) OR (X ((p33 <= 1)) AND (p835 <= 1))))) AND X (F ((2 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((2 <= p33))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((2 <= p33))
lola: processed formula length: 14
lola: 44 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 151 markings, 151 edges
lola: ========================================
lola: subprocess 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((2 <= p33)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((2 <= p33)))
lola: processed formula length: 18
lola: 44 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: 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: 151 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((1 <= p262))) OR G (((p604 + 1 <= p477) AND (p837 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p604 + 1 <= p477) AND (p837 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p604 + 1 <= p477) AND (p837 <= 2)))
lola: processed formula length: 40
lola: 44 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: 58 markings, 58 edges
lola: ========================================
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p262)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p262)))
lola: processed formula length: 19
lola: 44 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: 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: 151 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((p351 <= p798)))) AND X (X ((p351 <= p798)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p351 <= p798)))) AND X (X ((p351 <= p798)))))
lola: processed formula length: 57
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 120135 markings, 481848 edges, 24027 markings/sec, 0 secs
lola: 224948 markings, 911755 edges, 20963 markings/sec, 5 secs
lola: 328079 markings, 1321077 edges, 20626 markings/sec, 10 secs
lola: 428911 markings, 1732962 edges, 20166 markings/sec, 15 secs
lola: 528359 markings, 2146011 edges, 19890 markings/sec, 20 secs
lola: 622339 markings, 2532479 edges, 18796 markings/sec, 25 secs
lola: 720438 markings, 2936867 edges, 19620 markings/sec, 30 secs
lola: 812304 markings, 3317337 edges, 18373 markings/sec, 35 secs
lola: 899631 markings, 3676742 edges, 17465 markings/sec, 40 secs
lola: 999141 markings, 4092277 edges, 19902 markings/sec, 45 secs
lola: 1089571 markings, 4470979 edges, 18086 markings/sec, 50 secs
lola: 1187937 markings, 4883804 edges, 19673 markings/sec, 55 secs
lola: 1287661 markings, 5304610 edges, 19945 markings/sec, 60 secs
lola: 1384515 markings, 5712137 edges, 19371 markings/sec, 65 secs
lola: 1479918 markings, 6114067 edges, 19081 markings/sec, 70 secs
lola: 1569816 markings, 6495509 edges, 17980 markings/sec, 75 secs
lola: 1669608 markings, 6919077 edges, 19958 markings/sec, 80 secs
lola: 1761309 markings, 7314799 edges, 18340 markings/sec, 85 secs
lola: 1853380 markings, 7705213 edges, 18414 markings/sec, 90 secs
lola: 1950373 markings, 8115964 edges, 19399 markings/sec, 95 secs
lola: 2047548 markings, 8527402 edges, 19435 markings/sec, 100 secs
lola: 2143157 markings, 8933346 edges, 19122 markings/sec, 105 secs
lola: 2234670 markings, 9312131 edges, 18303 markings/sec, 110 secs
lola: 2323442 markings, 9686868 edges, 17754 markings/sec, 115 secs
lola: 2416311 markings, 10085452 edges, 18574 markings/sec, 120 secs
lola: 2508166 markings, 10478688 edges, 18371 markings/sec, 125 secs
lola: 2605347 markings, 10891733 edges, 19436 markings/sec, 130 secs
lola: 2694503 markings, 11272827 edges, 17831 markings/sec, 135 secs
lola: 2784853 markings, 11655500 edges, 18070 markings/sec, 140 secs
lola: 2877474 markings, 12047968 edges, 18524 markings/sec, 145 secs
lola: 2974441 markings, 12458721 edges, 19393 markings/sec, 150 secs
lola: 3069848 markings, 12864053 edges, 19081 markings/sec, 155 secs
lola: 3162260 markings, 13263581 edges, 18482 markings/sec, 160 secs
lola: 3255165 markings, 13661605 edges, 18581 markings/sec, 165 secs
lola: 3349244 markings, 14067213 edges, 18816 markings/sec, 170 secs
lola: 3437589 markings, 14445764 edges, 17669 markings/sec, 175 secs
lola: 3523493 markings, 14820671 edges, 17181 markings/sec, 180 secs
lola: 3614916 markings, 15218413 edges, 18285 markings/sec, 185 secs
lola: 3711039 markings, 15635639 edges, 19225 markings/sec, 190 secs
lola: 3803852 markings, 16042195 edges, 18563 markings/sec, 195 secs
lola: 3902526 markings, 16468878 edges, 19735 markings/sec, 200 secs
lola: 3998496 markings, 16885058 edges, 19194 markings/sec, 205 secs
lola: 4094382 markings, 17302874 edges, 19177 markings/sec, 210 secs
lola: 4184423 markings, 17700210 edges, 18008 markings/sec, 215 secs
lola: 4277264 markings, 18099534 edges, 18568 markings/sec, 220 secs
lola: 4350729 markings, 18394450 edges, 14693 markings/sec, 225 secs
lola: 4426135 markings, 18706606 edges, 15081 markings/sec, 230 secs
lola: 4503435 markings, 19016477 edges, 15460 markings/sec, 235 secs
lola: 4579720 markings, 19326656 edges, 15257 markings/sec, 240 secs
lola: 4656850 markings, 19645787 edges, 15426 markings/sec, 245 secs
lola: 4731067 markings, 19948363 edges, 14843 markings/sec, 250 secs
lola: 4805779 markings, 20252413 edges, 14942 markings/sec, 255 secs
lola: 4879237 markings, 20557023 edges, 14692 markings/sec, 260 secs
lola: 4953864 markings, 20866838 edges, 14925 markings/sec, 265 secs
lola: 5028749 markings, 21175827 edges, 14977 markings/sec, 270 secs
lola: 5103259 markings, 21485683 edges, 14902 markings/sec, 275 secs
lola: 5176358 markings, 21790994 edges, 14620 markings/sec, 280 secs
lola: 5244368 markings, 22078068 edges, 13602 markings/sec, 285 secs
lola: 5318161 markings, 22382384 edges, 14759 markings/sec, 290 secs
lola: 5389765 markings, 22679534 edges, 14321 markings/sec, 295 secs
lola: 5474422 markings, 23036549 edges, 16931 markings/sec, 300 secs
lola: 5558968 markings, 23389142 edges, 16909 markings/sec, 305 secs
lola: 5631954 markings, 23695357 edges, 14597 markings/sec, 310 secs
lola: 5713029 markings, 24037956 edges, 16215 markings/sec, 315 secs
lola: 5799427 markings, 24401142 edges, 17280 markings/sec, 320 secs
lola: 5877914 markings, 24734364 edges, 15697 markings/sec, 325 secs
lola: 5946935 markings, 25026655 edges, 13804 markings/sec, 330 secs
lola: 6019866 markings, 25331201 edges, 14586 markings/sec, 335 secs
lola: 6100224 markings, 25671743 edges, 16072 markings/sec, 340 secs
lola: 6170034 markings, 25970701 edges, 13962 markings/sec, 345 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 2095828 KB
lola: time consumption: 377 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p176 + 1 <= p857))) AND (G ((p724 + 1 <= p53)) OR (p53 <= p724)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p53 <= p724)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p53 <= p724)
lola: processed formula length: 13
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p176 + 1 <= p857)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p176 + 1 <= p857)))
lola: processed formula length: 26
lola: 44 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: 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: 151 markings, 151 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X ((X ((3 <= p459)) OR (p34 + 1 <= p466)))) U G (((p459 <= 2) AND (p694 + 1 <= p738))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X ((X ((3 <= p459)) OR (p34 + 1 <= p466)))) U G (((p459 <= 2) AND (p694 + 1 <= p738))))
lola: processed formula length: 91
lola: 44 rewrites
lola: closed formula file LTLCardinality.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: 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: 151 markings, 151 edges
lola: ========================================
lola: subprocess 5 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p234 <= p227)) AND (p618 + 1 <= p225)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p234 <= p227)) AND (p618 + 1 <= p225)))
lola: processed formula length: 47
lola: 44 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: 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: 301 markings, 302 edges
lola: ========================================
lola: subprocess 6 will run for 532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p806 <= p715)) AND (p395 <= p431))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p806 <= p715)) AND (p395 <= p431))))
lola: processed formula length: 47
lola: 44 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: 131 markings, 264 edges
lola: ========================================
lola: subprocess 7 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p458) OR (G (((1 <= p458))) AND F ((1 <= p458)))))) AND G (F ((3 <= p804))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p804)))
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 ((3 <= p804)))
lola: processed formula length: 19
lola: 44 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: 58 markings, 58 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 798 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p85 <= p217)))
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 ((p85 <= p217)))
lola: processed formula length: 21
lola: 44 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: add low 5751
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: 20792 markings, 62273 edges
lola: ========================================
lola: subprocess 9 will run for 1064 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p129 <= p518))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p129 <= p518))
lola: processed formula length: 18
lola: 44 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: 7978 markings, 18118 edges
lola: subprocess 10 will run for 1596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((3 <= p242))) AND (p109 + 1 <= p323))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((3 <= p242))) AND (p109 + 1 <= p323))))
lola: processed formula length: 52
lola: 44 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: 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: 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: 59 markings, 60 edges
lola: ========================================
lola: subprocess 11 will run for 3192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p20 + 1 <= p267)) OR (p20 + 1 <= p267))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p20 + 1 <= p267)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 + 1 <= p267)
lola: processed formula length: 17
lola: 44 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: X ((G (F (((p351 <= p798)))) AND X (X ((p351 <= p798)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((p351 <= p798)))) AND X (X ((p351 <= p798)))))
lola: processed formula length: 57
lola: 44 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 120000 markings, 481344 edges, 24000 markings/sec, 0 secs
lola: 224188 markings, 908462 edges, 20838 markings/sec, 5 secs
lola: 325656 markings, 1311378 edges, 20294 markings/sec, 10 secs
lola: 422805 markings, 1709113 edges, 19430 markings/sec, 15 secs
lola: 520577 markings, 2113429 edges, 19554 markings/sec, 20 secs
lola: 615127 markings, 2501615 edges, 18910 markings/sec, 25 secs
lola: 709357 markings, 2890336 edges, 18846 markings/sec, 30 secs
lola: 798824 markings, 3259518 edges, 17893 markings/sec, 35 secs
lola: 882756 markings, 3605072 edges, 16786 markings/sec, 40 secs
lola: 973885 markings, 3986456 edges, 18226 markings/sec, 45 secs
lola: 1068281 markings, 4382972 edges, 18879 markings/sec, 50 secs
lola: 1166044 markings, 4792521 edges, 19553 markings/sec, 55 secs
lola: 1270035 markings, 5231195 edges, 20798 markings/sec, 60 secs
lola: 1369387 markings, 5649066 edges, 19870 markings/sec, 65 secs
lola: 1466066 markings, 6055042 edges, 19336 markings/sec, 70 secs
lola: 1562323 markings, 6462964 edges, 19251 markings/sec, 75 secs
lola: 1663164 markings, 6891654 edges, 20168 markings/sec, 80 secs
lola: 1756153 markings, 7293275 edges, 18598 markings/sec, 85 secs
lola: 1848863 markings, 7685831 edges, 18542 markings/sec, 90 secs
lola: 1947658 markings, 8104285 edges, 19759 markings/sec, 95 secs
lola: 2046901 markings, 8524685 edges, 19849 markings/sec, 100 secs
lola: 2145306 markings, 8941933 edges, 19681 markings/sec, 105 secs
lola: 2239530 markings, 9333245 edges, 18845 markings/sec, 110 secs
lola: 2331360 markings, 9720542 edges, 18366 markings/sec, 115 secs
lola: 2427160 markings, 10132198 edges, 19160 markings/sec, 120 secs
lola: 2523407 markings, 10544629 edges, 19249 markings/sec, 125 secs
lola: 2617954 markings, 10946243 edges, 18909 markings/sec, 130 secs
lola: 2697385 markings, 11285346 edges, 15886 markings/sec, 135 secs
lola: 2779810 markings, 11633560 edges, 16485 markings/sec, 140 secs
lola: 2861820 markings, 11980556 edges, 16402 markings/sec, 145 secs
lola: 2951512 markings, 12362524 edges, 17938 markings/sec, 150 secs
lola: 3035649 markings, 12716951 edges, 16827 markings/sec, 155 secs
lola: 3117805 markings, 13070944 edges, 16431 markings/sec, 160 secs
lola: 3201986 markings, 13432717 edges, 16836 markings/sec, 165 secs
lola: 3294367 markings, 13830513 edges, 18476 markings/sec, 170 secs
lola: 3370765 markings, 14157811 edges, 15280 markings/sec, 175 secs
lola: 3452565 markings, 14512658 edges, 16360 markings/sec, 180 secs
lola: 3531326 markings, 14854415 edges, 15752 markings/sec, 185 secs
lola: 3618185 markings, 15232702 edges, 17372 markings/sec, 190 secs
lola: 3711239 markings, 15636537 edges, 18611 markings/sec, 195 secs
lola: 3798251 markings, 16018026 edges, 17402 markings/sec, 200 secs
lola: 3892153 markings, 16423872 edges, 18780 markings/sec, 205 secs
lola: 3982183 markings, 16814248 edges, 18006 markings/sec, 210 secs
lola: 4073480 markings, 17211858 edges, 18259 markings/sec, 215 secs
lola: 4162404 markings, 17603929 edges, 17785 markings/sec, 220 secs
lola: 4251284 markings, 17991849 edges, 17776 markings/sec, 225 secs
lola: 4319913 markings, 18266683 edges, 13726 markings/sec, 230 secs
lola: 4381265 markings, 18520954 edges, 12270 markings/sec, 235 secs
lola: 4450166 markings, 18802491 edges, 13780 markings/sec, 240 secs
lola: 4521199 markings, 19090937 edges, 14207 markings/sec, 245 secs
lola: 4584574 markings, 19345765 edges, 12675 markings/sec, 250 secs
lola: 4651832 markings, 19624410 edges, 13452 markings/sec, 255 secs
lola: 4716001 markings, 19890070 edges, 12834 markings/sec, 260 secs
lola: 4775371 markings, 20130536 edges, 11874 markings/sec, 265 secs
lola: 4838598 markings, 20387584 edges, 12645 markings/sec, 270 secs
lola: 4899462 markings, 20644066 edges, 12173 markings/sec, 275 secs
lola: 4965840 markings, 20917290 edges, 13276 markings/sec, 280 secs
lola: 5030230 markings, 21181742 edges, 12878 markings/sec, 285 secs
lola: 5092315 markings, 21438803 edges, 12417 markings/sec, 290 secs
lola: 5155706 markings, 21704756 edges, 12678 markings/sec, 295 secs
lola: 5220597 markings, 21976446 edges, 12978 markings/sec, 300 secs
lola: 5292655 markings, 22277735 edges, 14412 markings/sec, 305 secs
lola: 5374503 markings, 22614463 edges, 16370 markings/sec, 310 secs
lola: 5451440 markings, 22937994 edges, 15387 markings/sec, 315 secs
lola: 5520897 markings, 23229132 edges, 13891 markings/sec, 320 secs
lola: 5594357 markings, 23536919 edges, 14692 markings/sec, 325 secs
lola: 5660715 markings, 23816277 edges, 13272 markings/sec, 330 secs
lola: 5729067 markings, 24106172 edges, 13670 markings/sec, 335 secs
lola: 5809934 markings, 24446304 edges, 16173 markings/sec, 340 secs
lola: 5880009 markings, 24743346 edges, 14015 markings/sec, 345 secs
lola: 5944518 markings, 25016099 edges, 12902 markings/sec, 350 secs
lola: 6016596 markings, 25317091 edges, 14416 markings/sec, 355 secs
lola: 6094516 markings, 25647415 edges, 15584 markings/sec, 360 secs
lola: 6161150 markings, 25932410 edges, 13327 markings/sec, 365 secs
lola: 6237468 markings, 26255119 edges, 15264 markings/sec, 370 secs
lola: 6308039 markings, 26553297 edges, 14114 markings/sec, 375 secs
lola: 6370391 markings, 26813438 edges, 12470 markings/sec, 380 secs
lola: 6443885 markings, 27128518 edges, 14699 markings/sec, 385 secs
lola: 6512446 markings, 27417353 edges, 13712 markings/sec, 390 secs
lola: 6594205 markings, 27762134 edges, 16352 markings/sec, 395 secs
lola: 6674420 markings, 28102131 edges, 16043 markings/sec, 400 secs
lola: 6751891 markings, 28429940 edges, 15494 markings/sec, 405 secs
lola: 6833578 markings, 28779447 edges, 16337 markings/sec, 410 secs
lola: 6914599 markings, 29122289 edges, 16204 markings/sec, 415 secs
lola: 6999844 markings, 29489273 edges, 17049 markings/sec, 420 secs
lola: 7071182 markings, 29792653 edges, 14268 markings/sec, 425 secs
lola: 7144052 markings, 30102333 edges, 14574 markings/sec, 430 secs
lola: 7226517 markings, 30455365 edges, 16493 markings/sec, 435 secs
lola: 7308054 markings, 30801078 edges, 16307 markings/sec, 440 secs
lola: 7387939 markings, 31143600 edges, 15977 markings/sec, 445 secs
lola: 7471936 markings, 31503971 edges, 16799 markings/sec, 450 secs
lola: 7558333 markings, 31878259 edges, 17279 markings/sec, 455 secs
lola: 7645974 markings, 32256562 edges, 17528 markings/sec, 460 secs
lola: 7732414 markings, 32631445 edges, 17288 markings/sec, 465 secs
lola: 7816684 markings, 32999330 edges, 16854 markings/sec, 470 secs
lola: 7903520 markings, 33376179 edges, 17367 markings/sec, 475 secs
lola: 7990658 markings, 33755161 edges, 17428 markings/sec, 480 secs
lola: 8078010 markings, 34139713 edges, 17470 markings/sec, 485 secs
lola: 8163973 markings, 34513362 edges, 17193 markings/sec, 490 secs
lola: 8252068 markings, 34897098 edges, 17619 markings/sec, 495 secs
lola: 8343291 markings, 35284512 edges, 18245 markings/sec, 500 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: 8365509 markings, 35381561 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((p20 + 1 <= p267)) OR (p20 + 1 <= p267))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p20 + 1 <= p267)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p20 + 1 <= p267)
lola: processed formula length: 17
lola: 44 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: F ((p20 + 1 <= p267))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p267 <= p20)
lola: processed formula length: 13
lola: 46 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: 192 markings, 192 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no no no no yes no no
lola:
preliminary result: no no no no no no no no no yes no no
lola: ========================================
lola: memory consumption: 70848 KB
lola: time consumption: 885 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="Diffusion2D-PT-D30N010"
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 Diffusion2D-PT-D30N010, 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 r094-tall-162048902300069"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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