Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389400060.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 SmallOperatingSystem-PT-MT0256DC0064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389400060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.7K Apr 12 17:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 17:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 11 20:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 10 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 10 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 24 05:38 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 SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591199130570

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:45:33] [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-03 15:45:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:45:33] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2020-06-03 15:45:33] [INFO ] Transformed 9 places.
[2020-06-03 15:45:33] [INFO ] Transformed 8 transitions.
[2020-06-03 15:45:33] [INFO ] Parsed PT model containing 9 places and 8 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Finished random walk after 1560 steps, including 0 resets, run visited all 21 properties in 8 ms. (steps per millisecond=195 )
[2020-06-03 15:45:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 15:45:33] [INFO ] Flatten gal took : 25 ms
[2020-06-03 15:45:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 15:45:33] [INFO ] Flatten gal took : 5 ms
FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 15:45:33] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-03 15:45:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT0256DC0064 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0256DC0064-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2069
rslt: Output for CTLFireability @ SmallOperatingSystem-PT-MT0256DC0064

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 15:45:33 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX((EG(((p4 <= 0) OR (p6 <= 0))) AND (p4 <= 0)))",
"processed_size": 49,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 127,
"markings": 128,
"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": 274
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p4 <= 0) OR (p6 <= 0))",
"processed_size": 25,
"rewrites": 32
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p4 <= 0) OR (p6 <= 0))",
"processed_size": 25,
"rewrites": 32
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 329
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p4 <= 0) OR (p1 <= 0) OR (p2 <= 0))))",
"processed_size": 47,
"rewrites": 30
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A(((1 <= p5) AND (1 <= p6)) U EG((p4 <= 0)))",
"processed_size": 44,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 129,
"markings": 129,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 411
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((EF(((1 <= p2) AND (1 <= p5))) AND ((1 <= p4) AND ((p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)))))",
"processed_size": 95,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 388,
"markings": 131,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 470
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E(AF(((1 <= p4) OR ((1 <= p5) AND (1 <= p6)))) U ((1 <= p4) AND (1 <= p6) AND (1 <= p5) AND (((1 <= p2)) OR ((1 <= p1) AND (1 <= p2)))))",
"processed_size": 138,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 537,
"markings": 451,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 6,
"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": 6,
"visible_transitions": 0
},
"processed": "EG((EF(((p1 <= 0) OR (p2 <= 0))) OR ((1 <= p4) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p5)))))",
"processed_size": 94,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 22247793,
"markings": 7858599,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 655
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AF((((p3 <= 0) AND (1 <= p4)) AND (EG(((1 <= p4) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p2) AND (1 <= p8) AND (1 <= p5) AND (1 <= p6)))))",
"processed_size": 138,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 447,
"markings": 256,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p1 <= 0) OR (p2 <= 0))))",
"processed_size": 33,
"rewrites": 30
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1426
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((((p1 <= 0) OR (p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (1 <= p7) OR (1 <= p4)) U (1 <= p4)))",
"processed_size": 99,
"rewrites": 34
},
"result":
{
"edges": 64,
"markings": 65,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "universal_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2853
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(((1 <= p4) AND EF((1 <= p4))))",
"processed_size": 33,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 192,
"markings": 129,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 14,
"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": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p3) AND (p8 <= 0))",
"processed_size": 25,
"rewrites": 29
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(((1 <= p4) AND EF((1 <= p4))))",
"processed_size": 33,
"rewrites": 31
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 192,
"markings": 129,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p8) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)))",
"processed_size": 55,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3712,
"runtime": 1501.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F((** AND E(F(**))))) AND A(F(*))) : A((** U E(G(**)))) : A((** U **)) : (E(F(*)) OR **) : A(X(A(G(**)))) : (E(F(A(G(*)))) OR **) : E(X((E(G(*)) AND **))) : E(G((E(F(**)) OR **))) : E((A(F(**)) U **)) : E(F((* AND A(X(*))))) : (A(F(**)) OR (** OR (A(X(**)) OR **))) : A(F((** AND (E(G(**)) OR **)))) : A(F(**)) : A(F((E(F(**)) AND (** AND **)))) : E(G(*))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes no yes yes no unknown no yes yes unknown yes yes yes yes no ",
"value": "yes no yes yes no unknown no yes yes unknown yes yes yes 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: (A (F (((1 <= p4) AND E (F ((1 <= p4)))))) AND NOT(E (G (((1 <= p8) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6))))))) : A ((((1 <= p5) AND (1 <= p6)) U E (G ((p4 <= 0))))) : A ((((p1 <= 0) OR (p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (1 <= p7) OR (1 <= p4)) U (1 <= p4))) : (NOT(A (G (((1 <= p1) AND (1 <= p2))))) OR ((1 <= p4) AND (1 <= p6))) : A (G (A (X (((1 <= p1) AND (1 <= p2)))))) : (NOT(A (G (E (F ((1 <= p7)))))) OR ((1 <= p3) AND (p8 <= 0))) : E (X ((NOT(A (F (((1 <= p4) AND (1 <= p6))))) AND (p4 <= 0)))) : E (G ((E (F (((p1 <= 0) OR (p2 <= 0)))) OR ((1 <= p4) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p5)))))) : E ((A (F (((1 <= p4) OR ((1 <= p5) AND (1 <= p6))))) U ((1 <= p4) AND (1 <= p6) AND (1 <= p5) AND (((1 <= p2)) OR ((1 <= p1) AND (1 <= p2)))))) : NOT(A (G ((((1 <= p8) OR ((1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5))) OR E (X (((1 <= p1) AND (1 <= p2)))))))) : (((A (F (((1 <= p4) AND (1 <= p6)))) OR (1 <= p8)) OR A (X ((1 <= p7)))) OR ((1 <= p2) AND (1 <= p5))) : A (F ((((p3 <= 0) AND (1 <= p4)) AND (E (G (((1 <= p4) AND (1 <= p6)))) OR ((1 <= p1) AND (1 <= p2) AND (1 <= p8) AND (1 <= p5) AND (1 <= p6)))))) : A (F (((1 <= p4) AND (1 <= p6)))) : A (F (((E (F (((1 <= p2) AND (1 <= p5)))) AND (1 <= p4)) AND ((p3 <= 0) OR (p5 <= 0) OR (p6 <= 0))))) : NOT(A (F (((1 <= p4) AND (1 <= p1) AND (1 <= p2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p1) AND (1 <= p2))))))
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: ((p1 <= 0) OR (p2 <= 0))
lola: processed formula length: 25
lola: 32 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: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 64 markings, 63 edges
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file CTLFireability-0.sara.
sara: place or transition ordering is non-deterministic

lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G (((p4 <= 0) OR (p6 <= 0)))) AND (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EG(((p4 <= 0) OR (p6 <= 0))) AND (p4 <= 0)))
lola: processed formula length: 49
lola: 31 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: 128 markings, 127 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0))) AND A (X (((p1 <= 0) OR (p2 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0))) AND AX(((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 111
lola: 31 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: 2629950 markings, 7188159 edges, 525990 markings/sec, 0 secs
lola: 5015144 markings, 14046013 edges, 477039 markings/sec, 5 secs
lola: 7253306 markings, 20508516 edges, 447632 markings/sec, 10 secs
lola: 9481195 markings, 26932652 edges, 445578 markings/sec, 15 secs
lola: 11643079 markings, 33190654 edges, 432377 markings/sec, 20 secs
lola: 13811060 markings, 39475889 edges, 433596 markings/sec, 25 secs
lola: 16003069 markings, 45838673 edges, 438402 markings/sec, 30 secs
lola: 18045548 markings, 51779267 edges, 408496 markings/sec, 35 secs
lola: 20114833 markings, 57813599 edges, 413857 markings/sec, 40 secs
lola: 22334839 markings, 64300826 edges, 444001 markings/sec, 45 secs
lola: 24412705 markings, 70389816 edges, 415573 markings/sec, 50 secs
lola: 26404814 markings, 76245985 edges, 398422 markings/sec, 55 secs
lola: 28444713 markings, 82215749 edges, 407980 markings/sec, 60 secs
lola: 30460843 markings, 88087480 edges, 403226 markings/sec, 65 secs
lola: 32502652 markings, 94095916 edges, 408362 markings/sec, 70 secs
lola: 34488204 markings, 99912704 edges, 397110 markings/sec, 75 secs
lola: 36387711 markings, 105501797 edges, 379901 markings/sec, 80 secs
lola: 38378985 markings, 111366047 edges, 398255 markings/sec, 85 secs
lola: 40370663 markings, 117262812 edges, 398336 markings/sec, 90 secs
lola: 42500473 markings, 123508981 edges, 425962 markings/sec, 95 secs
lola: 44608494 markings, 129754236 edges, 421604 markings/sec, 100 secs
lola: 46597046 markings, 135642427 edges, 397710 markings/sec, 105 secs
lola: 48517209 markings, 141280247 edges, 384033 markings/sec, 110 secs
lola: 50433625 markings, 146914383 edges, 383283 markings/sec, 115 secs
lola: 52392513 markings, 152679775 edges, 391778 markings/sec, 120 secs
lola: 54213579 markings, 158075765 edges, 364213 markings/sec, 125 secs
lola: 56026483 markings, 163451373 edges, 362581 markings/sec, 130 secs
lola: 57890872 markings, 168935557 edges, 372878 markings/sec, 135 secs
lola: 59823078 markings, 174632585 edges, 386441 markings/sec, 140 secs
lola: 61707790 markings, 180151805 edges, 376942 markings/sec, 145 secs
lola: 63545388 markings, 185617235 edges, 367520 markings/sec, 150 secs
lola: 65405762 markings, 191129538 edges, 372075 markings/sec, 155 secs
lola: 67358450 markings, 196906757 edges, 390538 markings/sec, 160 secs
lola: 69226249 markings, 202415447 edges, 373560 markings/sec, 165 secs
lola: 71129949 markings, 208019973 edges, 380740 markings/sec, 170 secs
lola: 73025551 markings, 213658167 edges, 379120 markings/sec, 175 secs
lola: 74922005 markings, 219263619 edges, 379291 markings/sec, 180 secs
lola: 76927921 markings, 225179272 edges, 401183 markings/sec, 185 secs
lola: 78981213 markings, 231271672 edges, 410658 markings/sec, 190 secs
lola: 80968908 markings, 237171399 edges, 397539 markings/sec, 195 secs
lola: 82978960 markings, 243124816 edges, 402010 markings/sec, 200 secs
lola: 84963004 markings, 248936038 edges, 396809 markings/sec, 205 secs
lola: 86896457 markings, 254658483 edges, 386691 markings/sec, 210 secs
lola: 88850882 markings, 260458202 edges, 390885 markings/sec, 215 secs
lola: 90790642 markings, 266222982 edges, 387952 markings/sec, 220 secs
lola: 92617972 markings, 271632284 edges, 365466 markings/sec, 225 secs
lola: 94344814 markings, 276758951 edges, 345368 markings/sec, 230 secs
lola: 96294086 markings, 282500000 edges, 389854 markings/sec, 235 secs
lola: 98323242 markings, 288501256 edges, 405831 markings/sec, 240 secs
lola: 100250534 markings, 294229245 edges, 385458 markings/sec, 245 secs
lola: 102239574 markings, 300077871 edges, 397808 markings/sec, 250 secs
lola: 104100491 markings, 305610395 edges, 372183 markings/sec, 255 secs
lola: 105920780 markings, 310975396 edges, 364058 markings/sec, 260 secs
lola: 107730514 markings, 316360482 edges, 361947 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown no unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p4) AND (1 <= p6)))) OR ((1 <= p8) OR (A (X ((1 <= p7))) OR ((1 <= p2) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (p6 <= 0))
lola: processed formula length: 25
lola: 32 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4 <= 0) OR (p6 <= 0))
lola: processed formula length: 25
lola: 32 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-4-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 5 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p4 <= 0) OR (p1 <= 0) OR (p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p4 <= 0) OR (p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 47
lola: 30 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p4) AND (1 <= p1) AND (1 <= p2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 6 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p5) AND (1 <= p6)) U E (G ((p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((1 <= p5) AND (1 <= p6)) U EG((p4 <= 0)))
lola: processed formula length: 44
lola: 31 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 129 markings, 129 edges
lola: ========================================
lola: subprocess 7 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F (((1 <= p2) AND (1 <= p5)))) AND ((1 <= p4) AND ((p3 <= 0) OR (p5 <= 0) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EF(((1 <= p2) AND (1 <= p5))) AND ((1 <= p4) AND ((p3 <= 0) OR (p5 <= 0) OR (p6 <= 0)))))
lola: processed formula length: 95
lola: 31 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: 131 markings, 388 edges
lola: ========================================
lola: subprocess 8 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (((1 <= p4) OR ((1 <= p5) AND (1 <= p6))))) U ((1 <= p4) AND (1 <= p6) AND (1 <= p5) AND (((1 <= p2)) OR ((1 <= p1) AND (1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(AF(((1 <= p4) OR ((1 <= p5) AND (1 <= p6)))) U ((1 <= p4) AND (1 <= p6) AND (1 <= p5) AND (((1 <= p2)) OR ((1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 138
lola: 31 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: 451 markings, 537 edges
lola: ========================================
lola: subprocess 9 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (((p1 <= 0) OR (p2 <= 0)))) OR ((1 <= p4) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF(((p1 <= 0) OR (p2 <= 0))) OR ((1 <= p4) AND (1 <= p6) AND ((1 <= p8) OR (1 <= p5)))))
lola: processed formula length: 94
lola: 31 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: 3030666 markings, 8325051 edges, 606133 markings/sec, 0 secs
lola: 5561123 markings, 15617366 edges, 506091 markings/sec, 5 secs
lola: 7858599 markings, 22247788 edges, 459495 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 7858599 markings, 22247793 edges
lola: ========================================
lola: subprocess 10 will run for 655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p3 <= 0) AND (1 <= p4)) AND (E (G (((1 <= p4) AND (1 <= p6)))) OR ((1 <= p1) AND (1 <= p2) AND (1 <= p8) AND (1 <= p5) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((p3 <= 0) AND (1 <= p4)) AND (EG(((1 <= p4) AND (1 <= p6))) OR ((1 <= p1) AND (1 <= p2) AND (1 <= p8) AND (1 <= p5) AND (1 <= p6)))))
lola: processed formula length: 138
lola: 31 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: 256 markings, 447 edges
lola: ========================================
lola: subprocess 11 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p7 <= 0))))) OR ((1 <= p3) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 819 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (p8 <= 0))
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1092 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 33 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p7)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: state equation task get result unparse finished++ id 0
lola: formula 0: (p7 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-1.sara
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3205959 markings, 8554577 edges, 641192 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5933304 markings, 16106861 edges, 545469 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8622529 markings, 23572914 edges, 537845 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11064410 markings, 30342912 edges, 488376 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13517335 markings, 37189233 edges, 490585 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15830513 markings, 43649158 edges, 462636 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18111231 markings, 50038645 edges, 456144 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20661482 markings, 57251009 edges, 510050 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23279922 markings, 64604465 edges, 523688 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25758297 markings, 71615740 edges, 495675 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28199106 markings, 78525167 edges, 488162 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30721543 markings, 85643695 edges, 504487 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33129775 markings, 92480151 edges, 481646 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35556410 markings, 99354052 edges, 485327 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37902118 markings, 106001322 edges, 469142 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40261329 markings, 112714588 edges, 471842 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42568565 markings, 119264764 edges, 461447 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44880776 markings, 125818412 edges, 462442 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47095623 markings, 132102380 edges, 442969 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49367222 markings, 138613051 edges, 454320 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51686170 markings, 145230473 edges, 463790 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54044647 markings, 151966500 edges, 471695 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 56392563 markings, 158661162 edges, 469583 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58690060 markings, 165229210 edges, 459499 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 60965222 markings, 171777956 edges, 455032 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 63301464 markings, 178436802 edges, 467248 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65528887 markings, 184806793 edges, 445485 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 67846006 markings, 191359540 edges, 463424 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 70056637 markings, 197712482 edges, 442126 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 72334945 markings, 204229007 edges, 455662 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 74507122 markings, 210464445 edges, 434435 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 76736018 markings, 216869913 edges, 445779 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 78959841 markings, 223243833 edges, 444765 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 81164395 markings, 229574314 edges, 440911 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 83398943 markings, 235960657 edges, 446910 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 85574642 markings, 242209182 edges, 435140 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 87770002 markings, 248479474 edges, 439072 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 89977257 markings, 254838099 edges, 441451 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 92173338 markings, 261157662 edges, 439216 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 94503090 markings, 267775265 edges, 465950 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 96798028 markings, 274322799 edges, 458988 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 99020945 markings, 280717488 edges, 444583 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 101150864 markings, 286901702 edges, 425984 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 103465435 markings, 293558097 edges, 462914 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 105673682 markings, 299935620 edges, 441649 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 107880600 markings, 306280946 edges, 441384 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 110057379 markings, 312546086 edges, 435356 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 112232667 markings, 318854530 edges, 435058 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 114449181 markings, 325261433 edges, 443303 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 116582349 markings, 331432137 edges, 426634 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 118801342 markings, 337812851 edges, 443799 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 121005485 markings, 344174745 edges, 440829 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 123280204 markings, 350677864 edges, 454944 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 125477673 markings, 356986429 edges, 439494 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 127769144 markings, 363515701 edges, 458294 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 129969483 markings, 369897021 edges, 440068 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 132149013 markings, 376171986 edges, 435906 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 134380839 markings, 382560194 edges, 446365 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 136666440 markings, 389156057 edges, 457120 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 138844891 markings, 395481259 edges, 435690 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 141021940 markings, 401799718 edges, 435410 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 143277862 markings, 408297603 edges, 451184 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 145402191 markings, 414434351 edges, 424866 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 147536894 markings, 420616401 edges, 426941 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 149687716 markings, 426795421 edges, 430164 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 151619888 markings, 432426608 edges, 386434 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 153921601 markings, 439130910 edges, 460343 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 156153518 markings, 445556511 edges, 446383 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 158155826 markings, 451323171 edges, 400462 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 160188847 markings, 457166983 edges, 406604 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 162254298 markings, 463116745 edges, 413090 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 164289112 markings, 468999144 edges, 406963 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 166349767 markings, 474924498 edges, 412131 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 168316175 markings, 480688903 edges, 393282 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 170392956 markings, 486723971 edges, 415356 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 172287619 markings, 492211833 edges, 378933 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 174431672 markings, 498370189 edges, 428811 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 176463944 markings, 504288533 edges, 406454 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 178387221 markings, 509821669 edges, 384655 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 180361205 markings, 515466539 edges, 394797 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 182280712 markings, 520999860 edges, 383901 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 184327487 markings, 526935106 edges, 409355 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 186410137 markings, 532895119 edges, 416530 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 187540599 markings, 536161638 edges, 226092 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 12 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p1 <= 0) OR (p2 <= 0)))) OR ((1 <= p4) AND (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 951 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND (1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p4) AND (1 <= p6))
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= 0) OR (p2 <= 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 (((p1 <= 0) OR (p2 <= 0))))
lola: processed formula length: 33
lola: 30 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: ((p1 <= 0) OR (p2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p1 <= 0) OR (p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (1 <= p7) OR (1 <= p4)) U (1 <= p4)))
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 ((((p1 <= 0) OR (p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (1 <= p7) OR (1 <= p4)) U (1 <= p4)))
lola: processed formula length: 99
lola: 34 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 0) OR (p5 <= 0) OR (p6 <= 0) OR (1 <= p7) OR (1 <= p4))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 14 will run for 2853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p4) AND E (F ((1 <= p4)))))) AND A (F (((p8 <= 0) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND E (F ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((1 <= p4) AND EF((1 <= p4))))
lola: processed formula length: 33
lola: 31 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).
sara: try reading problem file CTLFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 129 markings, 192 edges
sara: place or transition ordering is non-deterministic
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: ========================================
lola: ...considering subproblem: E (F ((((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0))) AND A (X (((p1 <= 0) OR (p2 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0))) AND AX(((p1 <= 0) OR (p2 <= 0)))))
lola: processed formula length: 111
lola: 31 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: 2889074 markings, 7920331 edges, 577815 markings/sec, 0 secs
lola: 5333134 markings, 14967814 edges, 488812 markings/sec, 5 secs
lola: 7826916 markings, 22157604 edges, 498756 markings/sec, 10 secs
lola: 10254754 markings, 29182517 edges, 485568 markings/sec, 15 secs
lola: 12644920 markings, 36095091 edges, 478033 markings/sec, 20 secs
lola: 14982977 markings, 42841037 edges, 467611 markings/sec, 25 secs
lola: 17368312 markings, 49791205 edges, 477067 markings/sec, 30 secs
lola: 19706031 markings, 56613054 edges, 467544 markings/sec, 35 secs
lola: 22045168 markings, 63457609 edges, 467827 markings/sec, 40 secs
lola: 24397079 markings, 70343420 edges, 470382 markings/sec, 45 secs
lola: 26651608 markings, 76968634 edges, 450906 markings/sec, 50 secs
lola: 28939283 markings, 83677882 edges, 457535 markings/sec, 55 secs
lola: 31284128 markings, 90504422 edges, 468969 markings/sec, 60 secs
lola: 33561311 markings, 97194495 edges, 455437 markings/sec, 65 secs
lola: 35846015 markings, 103915790 edges, 456941 markings/sec, 70 secs
lola: 38074926 markings, 110457314 edges, 445782 markings/sec, 75 secs
lola: 40289240 markings, 117020843 edges, 442863 markings/sec, 80 secs
lola: 42497155 markings, 123499114 edges, 441583 markings/sec, 85 secs
lola: 44684341 markings, 129975819 edges, 437437 markings/sec, 90 secs
lola: 46878726 markings, 136459849 edges, 438877 markings/sec, 95 secs
lola: 49100061 markings, 142982203 edges, 444267 markings/sec, 100 secs
lola: 51281625 markings, 149410647 edges, 436313 markings/sec, 105 secs
lola: 53457821 markings, 155833448 edges, 435239 markings/sec, 110 secs
lola: 55596509 markings, 162164565 edges, 427738 markings/sec, 115 secs
lola: 57722673 markings, 168434651 edges, 425233 markings/sec, 120 secs
lola: 59926875 markings, 174933137 edges, 440840 markings/sec, 125 secs
lola: 62087167 markings, 181286892 edges, 432058 markings/sec, 130 secs
lola: 64178061 markings, 187509624 edges, 418179 markings/sec, 135 secs
lola: 66355224 markings, 193925559 edges, 435433 markings/sec, 140 secs
lola: 68475167 markings, 200183677 edges, 423989 markings/sec, 145 secs
lola: 70562059 markings, 206343564 edges, 417378 markings/sec, 150 secs
lola: 72635229 markings, 212482886 edges, 414634 markings/sec, 155 secs
lola: 74698874 markings, 218611367 edges, 412729 markings/sec, 160 secs
lola: 76626305 markings, 224257667 edges, 385486 markings/sec, 165 secs
lola: 78585724 markings, 230099728 edges, 391884 markings/sec, 170 secs
lola: 80583677 markings, 236036502 edges, 399591 markings/sec, 175 secs
lola: 82601085 markings, 242018009 edges, 403482 markings/sec, 180 secs
lola: 84657357 markings, 248041930 edges, 411254 markings/sec, 185 secs
lola: 86655822 markings, 253950225 edges, 399693 markings/sec, 190 secs
lola: 88622291 markings, 259776528 edges, 393294 markings/sec, 195 secs
lola: 90602422 markings, 265660833 edges, 396026 markings/sec, 200 secs
lola: 92540561 markings, 271395992 edges, 387628 markings/sec, 205 secs
lola: 94335873 markings, 276731545 edges, 359062 markings/sec, 210 secs
lola: 96390390 markings, 282780392 edges, 410903 markings/sec, 215 secs
lola: 98387318 markings, 288688631 edges, 399386 markings/sec, 220 secs
lola: 100366775 markings, 294571466 edges, 395891 markings/sec, 225 secs
lola: 102418511 markings, 300605461 edges, 410347 markings/sec, 230 secs
lola: 104291110 markings, 306191269 edges, 374520 markings/sec, 235 secs
lola: 106276770 markings, 312020506 edges, 397132 markings/sec, 240 secs
lola: 108161345 markings, 317615275 edges, 376915 markings/sec, 245 secs
lola: 110093663 markings, 323329894 edges, 386464 markings/sec, 250 secs
lola: 112072601 markings, 329158194 edges, 395788 markings/sec, 255 secs
lola: 113834389 markings, 334373925 edges, 352358 markings/sec, 260 secs
lola: 115487679 markings, 339313985 edges, 330658 markings/sec, 265 secs
lola: 116858856 markings, 343410819 edges, 274235 markings/sec, 270 secs
lola: 118548999 markings, 348399330 edges, 338029 markings/sec, 275 secs
lola: 119977183 markings, 352665771 edges, 285637 markings/sec, 280 secs
lola: 121631097 markings, 357529805 edges, 330783 markings/sec, 285 secs
lola: 123366085 markings, 362662431 edges, 346998 markings/sec, 290 secs
lola: 124798603 markings, 366938589 edges, 286504 markings/sec, 295 secs
lola: 126474015 markings, 371926719 edges, 335082 markings/sec, 300 secs
lola: 127944554 markings, 376333038 edges, 294108 markings/sec, 305 secs
lola: 129458811 markings, 380893261 edges, 302851 markings/sec, 310 secs
lola: 131180831 markings, 385985810 edges, 344404 markings/sec, 315 secs
lola: 132921028 markings, 391172751 edges, 348039 markings/sec, 320 secs
lola: 134443255 markings, 395748435 edges, 304445 markings/sec, 325 secs
lola: 136137020 markings, 400765470 edges, 338753 markings/sec, 330 secs
lola: 137785076 markings, 405654385 edges, 329611 markings/sec, 335 secs
lola: 139479314 markings, 410689412 edges, 338848 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((p7 <= 0))))) OR ((1 <= p3) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p3) AND (p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3) AND (p8 <= 0))
lola: processed formula length: 25
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p7)
lola: processed formula length: 9
lola: 33 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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p7)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: state equation task get result unparse finished++ id 0
lola: formula 0: (p7 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-1.sara.
sara: try reading problem file CTLFireability-17-0.sara.
sara: sara: place or transition ordering is non-deterministicplace or transition ordering is non-deterministic



lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2956282 markings, 7865915 edges, 591256 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5527439 markings, 14965273 edges, 514231 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8093837 markings, 22101416 edges, 513280 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10618965 markings, 29102417 edges, 505026 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13277473 markings, 36513791 edges, 531702 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 15654501 markings, 43158675 edges, 475406 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 17936596 markings, 49542970 edges, 456419 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20330417 markings, 56321814 edges, 478764 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 22712927 markings, 63012632 edges, 476502 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25186683 markings, 70000004 edges, 494751 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 27612616 markings, 76857808 edges, 485187 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30086016 markings, 83858237 edges, 494680 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 32602767 markings, 90970441 edges, 503350 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35084051 markings, 98030398 edges, 496257 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37565455 markings, 105049774 edges, 496281 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 39996256 markings, 111960947 edges, 486160 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42408146 markings, 118801971 edges, 482378 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 44774440 markings, 125511298 edges, 473259 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47153667 markings, 132269218 edges, 475845 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49439647 markings, 138824240 edges, 457196 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 51803043 markings, 145555953 edges, 472679 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54180050 markings, 152366157 edges, 475401 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 56546212 markings, 159091924 edges, 473232 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 58861961 markings, 165722017 edges, 463150 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 61170563 markings, 172378168 edges, 461720 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 63569905 markings, 179201622 edges, 479868 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 65911709 markings, 185902957 edges, 468361 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 68360199 markings, 192863787 edges, 489698 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 70690616 markings, 199530446 edges, 466083 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 73072637 markings, 206355176 edges, 476404 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 75355391 markings, 212897798 edges, 456551 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 77623881 markings, 219393584 edges, 453698 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 79912754 markings, 225964342 edges, 457775 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 82169035 markings, 232457475 edges, 451256 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 84491051 markings, 239062325 edges, 464403 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 86716250 markings, 245493509 edges, 445040 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 88962760 markings, 251913226 edges, 449302 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 91197085 markings, 258335193 edges, 446865 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 93486066 markings, 264885789 edges, 457796 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 95827612 markings, 271527275 edges, 468309 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 98054969 markings, 277939920 edges, 445471 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 100274345 markings, 284358582 edges, 443875 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 102558734 markings, 290951055 edges, 456878 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 104859518 markings, 297593200 edges, 460157 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 107135942 markings, 304155438 edges, 455285 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 109420041 markings, 310727026 edges, 456820 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 111531028 markings, 316835381 edges, 422197 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 113646230 markings, 322956163 edges, 423040 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 115592210 markings, 328586121 edges, 389196 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 117495666 markings, 334089447 edges, 380691 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 119531210 markings, 339904084 edges, 407109 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 121503443 markings, 345601366 edges, 394447 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 123505361 markings, 351311326 edges, 400384 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 125503757 markings, 357056724 edges, 399679 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 127539608 markings, 362871886 edges, 407170 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 129569110 markings, 368726825 edges, 405900 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 131595376 markings, 374571386 edges, 405253 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 133575563 markings, 380234541 edges, 396037 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 135588803 markings, 386060292 edges, 402648 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 137593246 markings, 391831999 edges, 400889 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 139488232 markings, 397377752 edges, 378997 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 141454788 markings, 403059083 edges, 393311 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 143504482 markings, 408939204 edges, 409939 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 145468311 markings, 414631074 edges, 392766 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 147442012 markings, 420346270 edges, 394740 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 149498534 markings, 426269392 edges, 411304 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 151348797 markings, 431654034 edges, 370053 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 153219961 markings, 437118616 edges, 374233 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 155163765 markings, 442701877 edges, 388761 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 157014131 markings, 448070693 edges, 370073 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 158917824 markings, 453518308 edges, 380739 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 160828905 markings, 459012422 edges, 382216 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 162715467 markings, 464428274 edges, 377312 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 164564144 markings, 469798323 edges, 369735 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 166469356 markings, 475274879 edges, 381042 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 168210549 markings, 480377338 edges, 348239 markings/sec, 375 secs
lola: sara is running 380 secs || sara is running 380 secs || 170079551 markings, 485832954 edges, 373800 markings/sec, 380 secs
lola: sara is running 385 secs || sara is running 385 secs || 171944058 markings, 491206972 edges, 372901 markings/sec, 385 secs
lola: sara is running 390 secs || sara is running 390 secs || 173864697 markings, 496738827 edges, 384128 markings/sec, 390 secs
lola: sara is running 395 secs || sara is running 395 secs || 175696427 markings, 502053446 edges, 366346 markings/sec, 395 secs
lola: sara is running 400 secs || sara is running 400 secs || 177547440 markings, 507362564 edges, 370203 markings/sec, 400 secs
lola: sara is running 405 secs || sara is running 405 secs || 179367109 markings, 512607138 edges, 363934 markings/sec, 405 secs
lola: sara is running 410 secs || sara is running 410 secs || 181215514 markings, 517926444 edges, 369681 markings/sec, 410 secs
lola: sara is running 415 secs || sara is running 415 secs || 183095727 markings, 523362833 edges, 376043 markings/sec, 415 secs
lola: sara is running 420 secs || sara is running 420 secs || 185001909 markings, 528865615 edges, 381236 markings/sec, 420 secs
lola: sara is running 425 secs || sara is running 425 secs || 186894003 markings, 534281852 edges, 378419 markings/sec, 425 secs
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: (A (F (((1 <= p4) AND E (F ((1 <= p4)))))) AND A (F (((p8 <= 0) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) AND E (F ((1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((1 <= p4) AND EF((1 <= p4))))
lola: processed formula length: 33
lola: 31 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: 129 markings, 192 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p8 <= 0) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p8) OR ((1 <= p2) AND (1 <= p5) AND (1 <= p6)))
lola: processed formula length: 55
lola: 32 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
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 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p8 <= 0) AND ((p2 <= 0) OR (p5 <= 0) OR (p6 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no unknown no yes yes unknown yes yes yes yes no
lola:
preliminary result: yes no yes yes no unknown no yes yes unknown yes yes yes yes no
lola: memory consumption: 3712 KB
lola: time consumption: 1501 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="SmallOperatingSystem-PT-MT0256DC0064"
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 SmallOperatingSystem-PT-MT0256DC0064, 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 r194-csrt-159033389400060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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