fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987939000436
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for SharedMemory-COL-000005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15727.770 3600000.00 9213.00 55.80 FTTTFFFTTFTFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987939000436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SharedMemory-COL-000005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987939000436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 15:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 15:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 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 SharedMemory-COL-000005-CTLFireability-00
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-01
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-02
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-03
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-04
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-05
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-06
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-07
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-08
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-09
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-10
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-11
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-12
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-13
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-14
FORMULA_NAME SharedMemory-COL-000005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591240718323

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:18:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:18:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-04 03:18:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 455 ms
[2020-06-04 03:18:40] [INFO ] sort/places :
P->ownMemAcc,queue,memory,active,
Dot->extBus,
PxP->extMemAcc,

[2020-06-04 03:18:40] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 46 PT places and 85.0 transition bindings in 12 ms.
[2020-06-04 03:18:40] [INFO ] Computed order based on color domains.
[2020-06-04 03:18:40] [INFO ] Unfolded HLPN to a Petri net with 46 places and 60 transitions in 6 ms.
[2020-06-04 03:18:40] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 45 ms.
Finished random walk after 422 steps, including 0 resets, run visited all 61 properties in 8 ms. (steps per millisecond=52 )
[2020-06-04 03:18:40] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 03:18:40] [INFO ] Flatten gal took : 27 ms
[2020-06-04 03:18:40] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 03:18:40] [INFO ] Flatten gal took : 9 ms
FORMULA SharedMemory-COL-000005-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000005-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 03:18:40] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 03:18:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SharedMemory-COL-000005 @ 3570 seconds

FORMULA SharedMemory-COL-000005-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000005-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ SharedMemory-COL-000005

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 03:18:40 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "AX(E(((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)) U ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))",
"processed_size": 379,
"rewrites": 204
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 20,
"adisj": 1,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AX((((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p40))))",
"processed_size": 921,
"rewrites": 203
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))",
"processed_size": 72,
"rewrites": 205
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))",
"processed_size": 278,
"rewrites": 239
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX(((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))",
"processed_size": 301,
"rewrites": 203
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AG(AF(EX(((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)))))",
"processed_size": 84,
"rewrites": 205
},
"net":
{
"conflict_clusters": 26,
"singleton_clusters": 0
},
"result":
{
"edges": 12278,
"markings": 1863,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))",
"processed_size": 80,
"rewrites": 203
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 20,
"adisj": 2,
"aneg": 0,
"comp": 65,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 65,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p40)))))",
"processed_size": 998,
"rewrites": 207
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))))",
"processed_size": 305,
"rewrites": 203
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))",
"processed_size": 80,
"rewrites": 203
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))",
"processed_size": 297,
"rewrites": 202
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 20,
"adisj": 2,
"aneg": 0,
"comp": 65,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 65,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p40)))))",
"processed_size": 998,
"rewrites": 207
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 62360,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(E((** U **)))) : A(X(**)) : A(X(A(G(**)))) : (A(X(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))))) : A(G(A(F(E(X(**)))))) : (E(F(**)) AND ((A((** U **)) AND A(F(**))) OR (E(F(*)) AND **)))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 26,
"places": 41,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 55
},
"result":
{
"preliminary_value": "no no no no yes no ",
"value": "no no no no yes 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: 96/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 41
lola: finding significant places
lola: 41 places, 55 transitions, 30 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 CTLFireability.xml
lola: A (X (E ((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)) U ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0)))))) : A (X ((((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p40))))) : NOT(E (F (NOT(A (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)))))))) : ((((((((((((((((((((A (X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))) OR (1 <= p20)) OR (1 <= p21)) OR (1 <= p22)) OR (1 <= p23)) OR (1 <= p24)) OR (1 <= p25)) OR (1 <= p26)) OR (1 <= p27)) OR (1 <= p28)) OR (1 <= p29)) OR (1 <= p30)) OR (1 <= p31)) OR (1 <= p32)) OR (1 <= p33)) OR (1 <= p34)) OR (1 <= p35)) OR (1 <= p37)) OR (1 <= p36)) OR (1 <= p39)) OR (1 <= p38)) : A (G (A (F (E (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)))))))) : (E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))) AND ((A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p10) AND (1 <= p40))))) AND A (F ((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)) AND ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)))))) OR (NOT(A (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15))))) AND ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E ((((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)) U ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(E(((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)) U ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))
lola: processed formula length: 379
lola: 204 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p11) AN... (shortened)
lola: processed formula length: 921
lola: 203 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))
lola: processed formula length: 72
lola: 205 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))) OR ((1 <= p20) OR ((1 <= p21) OR ((1 <= p22) OR ((1 <= p23) OR ((1 <= p24) OR ((1 <= p25) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p20) OR ((1 <= p21) OR ((1 <= p22) OR ((1 <= p23) OR ((1 <= p24) OR ((1 <= p25) OR ((1 <= p26) OR ((1 <= p27) OR ((1 <= p28) OR ((1 <= p29) OR ((1 <= p30) OR ((1 <= p31) OR ((1 <= p32) OR ((1 <= p33) OR ((1 <= p34) OR ((1 <= p35) OR ((1 <= p37) OR ((1 <= p36) OR ((1 <= p39) OR (1 <= p38))))))))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))
lola: processed formula length: 278
lola: 239 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 20 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 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))
lola: processed formula length: 301
lola: 203 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (E (X (((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(AF(EX(((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)))))
lola: processed formula length: 84
lola: 205 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1863 markings, 12278 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))) AND ((A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))
lola: processed formula length: 80
lola: 203 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR... (shortened)
lola: processed formula length: 998
lola: 207 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: formula 0: ((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15))
lola: state equation task get result unparse finished id 0
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: state equation: Generated DNF with 5 literals and 5 conjunctive subformulas
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))))
lola: processed formula length: 305
lola: 203 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38)))) AND ((A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))))
lola: processed formula length: 80
lola: 203 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= 0) AND (p17 <= 0) AND (p18 <= 0) AND (p19 <= 0) AND (p15 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p20) OR (1 <= p21) OR (1 <= p22) OR (1 <= p23) OR (1 <= p24) OR (1 <= p25) OR (1 <= p26) OR (1 <= p27) OR (1 <= p28) OR (1 <= p29) OR (1 <= p30) OR (1 <= p31) OR (1 <= p32) OR (1 <= p33) OR (1 <= p34) OR (1 <= p35) OR (1 <= p37) OR (1 <= p36) OR (1 <= p39) OR (1 <= p38))
lola: processed formula length: 297
lola: 202 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 20 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: A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p16) OR (1 <= p17) OR (1 <= p18) OR (1 <= p19) OR (1 <= p15)) U (((1 <= p6) AND (1 <= p14) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p12) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p11) AND (1 <= p40)) OR ((1 <= p9) AND (1 <= p13) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p10) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p14) AND (1 <= p40)) OR... (shortened)
lola: processed formula length: 998
lola: 207 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no
lola:
preliminary result: no no no no yes no
lola: memory consumption: 62360 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="SharedMemory-COL-000005"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is SharedMemory-COL-000005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987939000436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000005.tgz
mv SharedMemory-COL-000005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;