Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550100818.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool lola
Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550100818
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.7K Feb 11 05:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 05:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 7 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 114 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 352 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Jan 31 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rwxr-xr-x 1 mcc users 14M Mar 10 17:31 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-00
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-01
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-02
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-03
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-04
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-05
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-06
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-07
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-08
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-09
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14
FORMULA_NAME HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552683100848

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3570 seconds

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2473
rslt: Output for ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 20:51:40 2019
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 195
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F ((pb_d4_n2_1_3_1_3_2 <= 1)))",
"processed_size": 33,
"rewrites": 1
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 227
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((pol_d2_n1_3_2_2_3_1 <= pil_d1_n1_1_2_1_3_3) OR (po_d5_n1_3_3_1_2_2 <= pi_d4_n1_3_2_1_1_2))))",
"processed_size": 101,
"rewrites": 2
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 273
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((pi_d1_n1_2_2_3_1_3 <= 1) OR (pol_d1_n1_3_3_1_2_2 <= 1) OR ((pb_d3_n2_3_2_2_1_2 <= pol_d4_n1_3_3_1_2_1) AND (2 <= pil_d1_n1_3_1_3_2_3)) OR (1 <= pb_d3_n1_2_3_3_2_2))))",
"processed_size": 177,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 289
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 7,
"visible_transitions": 0
},
"processed": "E (F (((1 <= pol_d2_n1_3_2_2_2_3) AND (((pol_d2_n1_2_2_2_2_2 <= pol_d4_n1_3_1_2_1_1) AND (3 <= pb_d3_n2_2_1_3_1_1)) OR ((pol_d2_n1_1_1_2_2_2 <= pol_d3_n1_3_3_1_1_1) AND (2 <= pol_d3_n1_1_1_1_2_1))))))",
"processed_size": 201,
"rewrites": 1
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 325
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F ((((pb_d2_n1_2_2_1_2_2 + 1 <= pi_d2_n1_1_1_1_3_3) OR (pol_d2_n1_3_2_1_2_1 + 1 <= po_d4_n1_2_2_2_2_3)) AND ((pol_d5_n1_1_1_1_2_1 + 1 <= pi_d5_n1_3_1_2_1_3) OR (pil_d4_n1_3_2_3_3_1 + 1 <= pb_d2_n1_1_1_2_1_2)))))",
"processed_size": 216,
"rewrites": 1
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((pi_d5_n1_3_1_1_1_2 <= pi_d4_n1_2_1_1_3_1) OR (po_d3_n1_2_1_3_2_3 <= pol_d5_n1_1_1_3_1_3) OR (3 <= pol_d2_n1_1_3_2_3_3) OR ((po_d3_n1_1_2_1_1_2 + 1 <= pb_d1_n2_1_3_3_2_2) AND (pb_d1_n2_2_3_3_2_3 + 1 <= pi_d5_n1_2_3_1_1_2)))))",
"processed_size": 235,
"rewrites": 2
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 434
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((pi_d4_n1_3_3_2_2_3 + 1 <= pb_d2_n2_1_3_3_2_3) OR (po_d2_n1_2_1_2_3_2 <= 0) OR (pol_d1_n1_1_1_2_3_2 <= pb_d1_n1_2_3_1_3_1) OR (pbl_1_2_2_2_2 <= pi_d2_n1_2_3_2_2_1) OR (pol_d1_n1_2_1_2_1_1 <= pb_d4_n1_1_2_2_3_2))))",
"processed_size": 224,
"rewrites": 2
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"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": 9,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= po_d5_n1_2_1_3_1_3) AND (pol_d5_n1_1_2_2_1_3 <= pi_d4_n1_1_3_1_1_3) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR ((pb_d4_n2_3_2_2_1_1 <= po_d2_n1_2_3_1_1_1) AND (2 <= pol_d3_n1_3_2_1_1_2) AND (pb_d1_n2_1_3_3_1_2 + 1 <= pb_d2_n2_2_2_2_2_2)))))",
"processed_size": 247,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 618
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 9,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= pil_d1_n1_2_3_2_2_2) AND (pil_d3_n1_1_1_1_3_3 <= pi_d1_n1_3_1_1_3_2)) OR (pb_d1_n2_2_1_2_2_2 + 1 <= po_d2_n1_2_1_1_3_2) OR ((pb_d3_n1_2_3_2_3_1 + 1 <= pil_d5_n1_1_1_1_2_2) AND (pil_d5_n1_1_1_2_1_3 + 1 <= pi_d3_n1_2_1_2_3_2)))))",
"processed_size": 243,
"rewrites": 1
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 824
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 9,
"visible_transitions": 0
},
"processed": "E (F ((((pb_d2_n2_2_2_2_1_1 <= po_d3_n1_3_3_2_2_2) OR (pi_d4_n1_3_3_1_1_3 <= pb_d2_n2_2_3_1_3_2) OR ((pil_d1_n1_1_2_3_2_2 <= po_d4_n1_1_1_3_3_2) AND (1 <= po_d2_n1_3_3_3_2_1))) AND (pb_d3_n2_1_3_3_3_3 + 1 <= pil_d4_n1_1_1_2_2_3))))",
"processed_size": 233,
"rewrites": 1
},
"result":
{
"edges": 7,
"markings": 8,
"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": 7,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((pil_d2_n1_3_3_2_1_3 + 1 <= pi_d2_n1_1_2_1_3_2) AND (pil_d4_n1_3_2_3_3_3 + 1 <= pi_d3_n1_2_1_3_1_3) AND (3 <= pb_d4_n1_3_2_3_2_1) AND (pol_d2_n1_1_3_1_2_2 <= pil_d4_n1_2_2_3_1_2) AND ((3 <= po_d1_n1_1_2_3_2_2) OR (pi_d2_n1_1_1_1_3_1 <= pb_d3_n1_2_2_1_1_1)))))",
"processed_size": 267,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "A (G (((pb_d3_n2_3_1_3_2_3 <= po_d4_n1_1_2_1_2_1) OR (pb_d2_n1_3_2_1_3_3 <= po_d4_n1_1_3_1_2_2) OR (pol_d5_n1_2_1_2_1_3 + 1 <= pb_d5_n2_3_1_2_3_1) OR (pil_d3_n1_3_2_2_1_2 <= pb_d2_n2_1_1_1_3_2) OR (3 <= pil_d2_n1_2_3_1_1_2) OR (pil_d3_n1_3_1_3_1_1 <= pb_d2_n1_2_1_3_2_3))))",
"processed_size": 278,
"rewrites": 2
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 2364472,
"runtime": 1096.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 97200,
"conflict_clusters": 2673,
"places": 7533,
"places_significant": 4859,
"singleton_clusters": 0,
"transitions": 24300
},
"result":
{
"preliminary_value": "no no no yes yes yes no no no no yes yes no yes yes yes ",
"value": "no no no yes yes yes no no no no yes yes no yes yes yes "
},
"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: 31833/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 241056
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 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 ReachabilityCardinality.xml
lola: A (G ((1 <= pb_d5_n2_1_3_2_1_2))) : A (G (((pb_d3_n2_3_1_3_2_3 <= po_d4_n1_1_2_1_2_1) OR (pb_d2_n1_3_2_1_3_3 <= po_d4_n1_1_3_1_2_2) OR (pol_d5_n1_2_1_2_1_3 + 1 <= pb_d5_n2_3_1_2_3_1) OR (pil_d3_n1_3_2_2_1_2 <= pb_d2_n2_1_1_1_3_2) OR (3 <= pil_d2_n1_2_3_1_1_2) OR (pil_d3_n1_3_1_3_1_1 <= pb_d2_n1_2_1_3_2_3)))) : A (G ((1 <= pb_d2_n2_2_2_2_2_1))) : E (F ((((pb_d2_n1_2_2_1_2_2 + 1 <= pi_d2_n1_1_1_1_3_3) OR (pol_d2_n1_3_2_1_2_1 + 1 <= po_d4_n1_2_2_2_2_3)) AND ((pol_d5_n1_1_1_1_2_1 + 1 <= pi_d5_n1_3_1_2_1_3) OR (pil_d4_n1_3_2_3_3_1 + 1 <= pb_d2_n1_1_1_2_1_2))))) : E (F (((1 <= pol_d2_n1_3_2_2_2_3) AND (((pol_d2_n1_2_2_2_2_2 <= pol_d4_n1_3_1_2_1_1) AND (3 <= pb_d3_n2_2_1_3_1_1)) OR ((pol_d2_n1_1_1_2_2_2 <= pol_d3_n1_3_3_1_1_1) AND (2 <= pol_d3_n1_1_1_1_2_1)))))) : E (F ((pb_d4_n2_1_3_1_3_2 <= 1))) : A (G (((pol_d2_n1_3_2_2_3_1 <= pil_d1_n1_1_2_1_3_3) OR (po_d5_n1_3_3_1_2_2 <= pi_d4_n1_3_2_1_1_2)))) : A (G (((pi_d5_n1_3_1_1_1_2 <= pi_d4_n1_2_1_1_3_1) OR (po_d3_n1_2_1_3_2_3 <= pol_d5_n1_1_1_3_1_3) OR (3 <= pol_d2_n1_1_3_2_3_3) OR ((po_d3_n1_1_2_1_1_2 + 1 <= pb_d1_n2_1_3_3_2_2) AND (pb_d1_n2_2_3_3_2_3 + 1 <= pi_d5_n1_2_3_1_1_2))))) : A (G (((pi_d4_n1_3_3_2_2_3 + 1 <= pb_d2_n2_1_3_3_2_3) OR (po_d2_n1_2_1_2_3_2 <= 0) OR (pol_d1_n1_1_1_2_3_2 <= pb_d1_n1_2_3_1_3_1) OR (pbl_1_2_2_2_2 <= pi_d2_n1_2_3_2_2_1) OR (pol_d1_n1_2_1_2_1_1 <= pb_d4_n1_1_2_2_3_2)))) : E (F ((((2 <= po_d5_n1_2_1_3_1_3) AND (pol_d5_n1_1_2_2_1_3 <= pi_d4_n1_1_3_1_1_3) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR ((pb_d4_n2_3_2_2_1_1 <= po_d2_n1_2_3_1_1_1) AND (2 <= pol_d3_n1_3_2_1_1_2) AND (pb_d1_n2_1_3_3_1_2 + 1 <= pb_d2_n2_2_2_2_2_2))))) : E (F (((pil_d2_n1_3_3_2_1_3 + 1 <= pi_d2_n1_1_2_1_3_2) AND (pil_d4_n1_3_2_3_3_3 + 1 <= pi_d3_n1_2_1_3_1_3) AND (3 <= pb_d4_n1_3_2_3_2_1) AND (pol_d2_n1_1_3_1_2_2 <= pil_d4_n1_2_2_3_1_2) AND ((3 <= po_d1_n1_1_2_3_2_2) OR (pi_d2_n1_1_1_1_3_1 <= pb_d3_n1_2_2_1_1_1))))) : E (F (((po_d2_n1_1_1_2_2_1 <= 1) AND (pb_d5_n2_1_3_1_3_3 <= 0) AND (pi_d4_n1_2_3_3_2_1 <= 1) AND (pil_d5_n1_3_3_2_2_2 + 1 <= po_d2_n1_3_1_3_2_2)))) : A (G ((pb_d5_n2_2_3_2_3_2 <= pb_d5_n2_3_1_1_3_1))) : A (G (((pi_d1_n1_2_2_3_1_3 <= 1) OR (pol_d1_n1_3_3_1_2_2 <= 1) OR ((pb_d3_n2_3_2_2_1_2 <= pol_d4_n1_3_3_1_2_1) AND (2 <= pil_d1_n1_3_1_3_2_3)) OR (1 <= pb_d3_n1_2_3_3_2_2)))) : E (F ((((2 <= pil_d1_n1_2_3_2_2_2) AND (pil_d3_n1_1_1_1_3_3 <= pi_d1_n1_3_1_1_3_2)) OR (pb_d1_n2_2_1_2_2_2 + 1 <= po_d2_n1_2_1_1_3_2) OR ((pb_d3_n1_2_3_2_3_1 + 1 <= pil_d5_n1_1_1_1_2_2) AND (pil_d5_n1_1_1_2_1_3 + 1 <= pi_d3_n1_2_1_2_3_2))))) : E (F ((((pb_d2_n2_2_2_2_1_1 <= po_d3_n1_3_3_2_2_2) OR (pi_d4_n1_3_3_1_1_3 <= pb_d2_n2_2_3_1_3_2) OR ((pil_d1_n1_1_2_3_2_2 <= po_d4_n1_1_1_3_3_2) AND (1 <= po_d2_n1_3_3_3_2_1))) AND (pb_d3_n2_1_3_3_3_3 + 1 <= pil_d4_n1_1_1_2_2_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 170 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d5_n2_1_3_2_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= pb_d5_n2_1_3_2_1_2)))
lola: processed formula length: 33
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: (pb_d5_n2_1_3_2_1_2 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d2_n2_2_2_2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= pb_d2_n2_2_2_2_2_1)))
lola: processed formula length: 33
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: (pb_d2_n2_2_2_2_2_1 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d4_n2_1_3_1_3_2 <= 1)))
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 ((pb_d4_n2_1_3_1_3_2 <= 1)))
lola: processed formula length: 33
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (pb_d4_n2_1_3_1_3_2 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pb_d5_n2_2_3_2_3_2 <= pb_d5_n2_3_1_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((pb_d5_n2_2_3_2_3_2 <= pb_d5_n2_3_1_1_3_1)))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: (pb_d5_n2_3_1_1_3_1 + 1 <= pb_d5_n2_2_3_2_3_2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d2_n1_3_2_2_3_1 <= pil_d1_n1_1_2_1_3_3) OR (po_d5_n1_3_3_1_2_2 <= pi_d4_n1_3_2_1_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((pol_d2_n1_3_2_2_3_1 <= pil_d1_n1_1_2_1_3_3) OR (po_d5_n1_3_3_1_2_2 <= pi_d4_n1_3_2_1_1_2))))
lola: processed formula length: 101
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: ((pil_d1_n1_1_2_1_3_3 + 1 <= pol_d2_n1_3_2_2_3_1) AND (pi_d4_n1_3_2_1_1_2 + 1 <= po_d5_n1_3_3_1_2_2))
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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d2_n1_1_1_2_2_1 <= 1) AND (pb_d5_n2_1_3_1_3_3 <= 0) AND (pi_d4_n1_2_3_3_2_1 <= 1) AND (pil_d5_n1_3_3_2_2_2 + 1 <= po_d2_n1_3_1_3_2_2))))
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 (((po_d2_n1_1_1_2_2_1 <= 1) AND (pb_d5_n2_1_3_1_3_3 <= 0) AND (pi_d4_n1_2_3_3_2_1 <= 1) AND (pil_d5_n1_3_3_2_2_2 + 1 <= po_d2_n1_3_1_3_2_2))))
lola: processed formula length: 147
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((po_d2_n1_1_1_2_2_1 <= 1) AND (pb_d5_n2_1_3_1_3_3 <= 0) AND (pi_d4_n1_2_3_3_2_1 <= 1) AND (pil_d5_n1_3_3_2_2_2 + 1 <= po_d2_n1_3_1_3_2_2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d1_n1_2_2_3_1_3 <= 1) OR (pol_d1_n1_3_3_1_2_2 <= 1) OR ((pb_d3_n2_3_2_2_1_2 <= pol_d4_n1_3_3_1_2_1) AND (2 <= pil_d1_n1_3_1_3_2_3)) OR (1 <= pb_d3_n1_2_3_3_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((pi_d1_n1_2_2_3_1_3 <= 1) OR (pol_d1_n1_3_3_1_2_2 <= 1) OR ((pb_d3_n2_3_2_2_1_2 <= pol_d4_n1_3_3_1_2_1) AND (2 <= pil_d1_n1_3_1_3_2_3)) OR (1 <= pb_d3_n1_2_3_3_2_2))))
lola: processed formula length: 177
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: ((2 <= pi_d1_n1_2_2_3_1_3) AND (2 <= pol_d1_n1_3_3_1_2_2) AND ((pol_d4_n1_3_3_1_2_1 + 1 <= pb_d3_n2_3_2_2_1_2) OR (pil_d1_n1_3_1_3_2_3 <= 1)) AND (pb_d3_n1_2_3_3_2_2 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
lola: sara is running 0 secs || 35396 markings, 38473 edges, 7079 markings/sec, 0 secs
lola: sara is running 5 secs || 67219 markings, 73542 edges, 6365 markings/sec, 5 secs
lola: sara is running 10 secs || 100010 markings, 109323 edges, 6558 markings/sec, 10 secs
lola: sara is running 15 secs || 128901 markings, 141503 edges, 5778 markings/sec, 15 secs
lola: sara is running 20 secs || 154778 markings, 171068 edges, 5175 markings/sec, 20 secs
lola: sara is running 25 secs || 180450 markings, 200324 edges, 5134 markings/sec, 25 secs
lola: sara is running 30 secs || 206955 markings, 230409 edges, 5301 markings/sec, 30 secs
lola: sara is running 35 secs || 233262 markings, 260053 edges, 5261 markings/sec, 35 secs
lola: sara is running 40 secs || 257552 markings, 287294 edges, 4858 markings/sec, 40 secs
lola: sara is running 45 secs || 278947 markings, 309661 edges, 4279 markings/sec, 45 secs
lola: sara is running 50 secs || 298489 markings, 329423 edges, 3908 markings/sec, 50 secs
lola: sara is running 55 secs || 322637 markings, 353931 edges, 4830 markings/sec, 55 secs
lola: sara is running 60 secs || 345870 markings, 377225 edges, 4647 markings/sec, 60 secs
lola: sara is running 65 secs || 363507 markings, 394944 edges, 3527 markings/sec, 65 secs
lola: sara is running 70 secs || 377797 markings, 409488 edges, 2858 markings/sec, 70 secs
lola: sara is running 75 secs || 392119 markings, 423962 edges, 2864 markings/sec, 75 secs
lola: sara is running 80 secs || 405719 markings, 437622 edges, 2720 markings/sec, 80 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 85 secs || 418341 markings, 450266 edges, 2524 markings/sec, 85 secs
lola: sara is running 90 secs || 430470 markings, 462566 edges, 2426 markings/sec, 90 secs
lola: sara is running 95 secs || 442758 markings, 475021 edges, 2458 markings/sec, 95 secs

lola: sara is running 100 secs || 455531 markings, 488028 edges, 2555 markings/sec, 100 secs
lola: sara is running 105 secs || 467860 markings, 500570 edges, 2466 markings/sec, 105 secs
lola: sara is running 110 secs || 480139 markings, 512938 edges, 2456 markings/sec, 110 secs
lola: sara is running 115 secs || 492774 markings, 525696 edges, 2527 markings/sec, 115 secs
lola: sara is running 120 secs || 505097 markings, 538166 edges, 2465 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pol_d2_n1_3_2_2_2_3) AND (((pol_d2_n1_2_2_2_2_2 <= pol_d4_n1_3_1_2_1_1) AND (3 <= pb_d3_n2_2_1_3_1_1)) OR ((pol_d2_n1_1_1_2_2_2 <= pol_d3_n1_3_3_1_1_1) AND (2 <= pol_d3_n1_1_1_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= pol_d2_n1_3_2_2_2_3) AND (((pol_d2_n1_2_2_2_2_2 <= pol_d4_n1_3_1_2_1_1) AND (3 <= pb_d3_n2_2_1_3_1_1)) OR ((pol_d2_n1_1_1_2_2_2 <= pol_d3_n1_3_3_1_1_1) AND (2 <= pol_d3_n1_1_1_1_2_1))))))
lola: processed formula length: 201
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((1 <= pol_d2_n1_3_2_2_2_3) AND (((pol_d2_n1_2_2_2_2_2 <= pol_d4_n1_3_1_2_1_1) AND (3 <= pb_d3_n2_2_1_3_1_1)) OR ((pol_d2_n1_1_1_2_2_2 <= pol_d3_n1_3_3_1_1_1) AND (2 <= pol_d3_n1_1_1_1_2_1))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 325 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pb_d2_n1_2_2_1_2_2 + 1 <= pi_d2_n1_1_1_1_3_3) OR (pol_d2_n1_3_2_1_2_1 + 1 <= po_d4_n1_2_2_2_2_3)) AND ((pol_d5_n1_1_1_1_2_1 + 1 <= pi_d5_n1_3_1_2_1_3) OR (pil_d4_n1_3_2_3_3_1 + 1 <= pb_d2_n1_1_1_2_1_2)))))
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 ((((pb_d2_n1_2_2_1_2_2 + 1 <= pi_d2_n1_1_1_1_3_3) OR (pol_d2_n1_3_2_1_2_1 + 1 <= po_d4_n1_2_2_2_2_3)) AND ((pol_d5_n1_1_1_1_2_1 + 1 <= pi_d5_n1_3_1_2_1_3) OR (pil_d4_n1_3_2_3_3_1 + 1 <= pb_d2_n1_1_1_2_1_2)))))
lola: processed formula length: 216
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((pb_d2_n1_2_2_1_2_2 + 1 <= pi_d2_n1_1_1_1_3_3) OR (pol_d2_n1_3_2_1_2_1 + 1 <= po_d4_n1_2_2_2_2_3)) AND ((pol_d5_n1_1_1_1_2_1 + 1 <= pi_d5_n1_3_1_2_1_3) OR (pil_d4_n1_3_2_3_3_1 + 1 <= pb_d2_n1_1_1_2_1_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d5_n1_3_1_1_1_2 <= pi_d4_n1_2_1_1_3_1) OR (po_d3_n1_2_1_3_2_3 <= pol_d5_n1_1_1_3_1_3) OR (3 <= pol_d2_n1_1_3_2_3_3) OR ((po_d3_n1_1_2_1_1_2 + 1 <= pb_d1_n2_1_3_3_2_2) AND (pb_d1_n2_2_3_3_2_3 + 1 <= pi_d5_n1_2_3_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((pi_d5_n1_3_1_1_1_2 <= pi_d4_n1_2_1_1_3_1) OR (po_d3_n1_2_1_3_2_3 <= pol_d5_n1_1_1_3_1_3) OR (3 <= pol_d2_n1_1_3_2_3_3) OR ((po_d3_n1_1_2_1_1_2 + 1 <= pb_d1_n2_1_3_3_2_2) AND (pb_d1_n2_2_3_3_2_3 + 1 <= pi_d5_n1_2_3_1_1_2)))))
lola: processed formula length: 235
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: ((pi_d4_n1_2_1_1_3_1 + 1 <= pi_d5_n1_3_1_1_1_2) AND (pol_d5_n1_1_1_3_1_3 + 1 <= po_d3_n1_2_1_3_2_3) AND (pol_d2_n1_1_3_2_3_3 <= 2) AND ((pb_d1_n2_1_3_3_2_2 <= po_d3_n1_1_2_1_1_2) OR (pi_d5_n1_2_3_1_1_2 <= pb_d1_n2_2_3_3_2_3)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d4_n1_3_3_2_2_3 + 1 <= pb_d2_n2_1_3_3_2_3) OR (po_d2_n1_2_1_2_3_2 <= 0) OR (pol_d1_n1_1_1_2_3_2 <= pb_d1_n1_2_3_1_3_1) OR (pbl_1_2_2_2_2 <= pi_d2_n1_2_3_2_2_1) OR (pol_d1_n1_2_1_2_1_1 <= pb_d4_n1_1_2_2_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((pi_d4_n1_3_3_2_2_3 + 1 <= pb_d2_n2_1_3_3_2_3) OR (po_d2_n1_2_1_2_3_2 <= 0) OR (pol_d1_n1_1_1_2_3_2 <= pb_d1_n1_2_3_1_3_1) OR (pbl_1_2_2_2_2 <= pi_d2_n1_2_3_2_2_1) OR (pol_d1_n1_2_1_2_1_1 <= pb_d4_n1_1_2_2_3_2))))
lola: processed formula length: 224
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: ((pb_d2_n2_1_3_3_2_3 <= pi_d4_n1_3_3_2_2_3) AND (1 <= po_d2_n1_2_1_2_3_2) AND (pb_d1_n1_2_3_1_3_1 + 1 <= pol_d1_n1_1_1_2_3_2) AND (pi_d2_n1_2_3_2_2_1 + 1 <= pbl_1_2_2_2_2) AND (pb_d4_n1_1_2_2_3_2 + 1 <= pol_d1_n1_2_1_2_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 11 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= po_d5_n1_2_1_3_1_3) AND (pol_d5_n1_1_2_2_1_3 <= pi_d4_n1_1_3_1_1_3) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR ((pb_d4_n2_3_2_2_1_1 <= po_d2_n1_2_3_1_1_1) AND (2 <= pol_d3_n1_3_2_1_1_2) AND (pb_d1_n2_1_3_3_1_2 + 1 <= pb_d2_n2_2_2_2_2_2)))))
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 ((((2 <= po_d5_n1_2_1_3_1_3) AND (pol_d5_n1_1_2_2_1_3 <= pi_d4_n1_1_3_1_1_3) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR ((pb_d4_n2_3_2_2_1_1 <= po_d2_n1_2_3_1_1_1) AND (2 <= pol_d3_n1_3_2_1_1_2) AND (pb_d1_n2_1_3_3_1_2 + 1 <= pb_d2_n2_2_2_2_2_2)))))
lola: processed formula length: 247
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((2 <= po_d5_n1_2_1_3_1_3) AND (pol_d5_n1_1_2_2_1_3 <= pi_d4_n1_1_3_1_1_3) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR ((pb_d4_n2_3_2_2_1_1 <= po_d2_n1_2_3_1_1_1) AND (2 <= pol_d3_n1_3_2_1_1_2) AND (pb_d1_n2_1_3_3_1_2 + 1 <= pb_d2_n2_2_2_2_2_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 27948 markings, 30740 edges, 5590 markings/sec, 0 secs
lola: sara is running 5 secs || 51623 markings, 56214 edges, 4735 markings/sec, 5 secs
lola: sara is running 10 secs || 74694 markings, 81010 edges, 4614 markings/sec, 10 secs
lola: sara is running 15 secs || 96698 markings, 104667 edges, 4401 markings/sec, 15 secs
lola: sara is running 20 secs || 119563 markings, 129252 edges, 4573 markings/sec, 20 secs
lola: sara is running 25 secs || 141541 markings, 152848 edges, 4396 markings/sec, 25 secs
lola: sara is running 30 secs || 161713 markings, 174314 edges, 4034 markings/sec, 30 secs
lola: sara is running 35 secs || 182653 markings, 195640 edges, 4188 markings/sec, 35 secs
lola: sara is running 40 secs || 206334 markings, 219449 edges, 4736 markings/sec, 40 secs
lola: sara is running 45 secs || 229906 markings, 243361 edges, 4714 markings/sec, 45 secs
lola: sara is running 50 secs || 250563 markings, 264088 edges, 4131 markings/sec, 50 secs
lola: sara is running 55 secs || 268487 markings, 282461 edges, 3585 markings/sec, 55 secs
lola: sara is running 60 secs || 284047 markings, 298216 edges, 3112 markings/sec, 60 secs
lola: sara is running 65 secs || 297286 markings, 311673 edges, 2648 markings/sec, 65 secs
lola: sara is running 70 secs || 309562 markings, 323997 edges, 2455 markings/sec, 70 secs
lola: sara is running 75 secs || 322309 markings, 336890 edges, 2549 markings/sec, 75 secs
lola: sara is running 80 secs || 335081 markings, 349775 edges, 2554 markings/sec, 80 secs
lola: sara is running 85 secs || 347860 markings, 362698 edges, 2556 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 90 secs || 359808 markings, 374729 edges, 2390 markings/sec, 90 secs
lola: sara is running 95 secs || 371786 markings, 386759 edges, 2396 markings/sec, 95 secs
lola: sara is running 100 secs || 383123 markings, 398137 edges, 2267 markings/sec, 100 secs

lola: sara is running 105 secs || 394222 markings, 409269 edges, 2220 markings/sec, 105 secs
lola: sara is running 110 secs || 405158 markings, 420378 edges, 2187 markings/sec, 110 secs
lola: sara is running 115 secs || 416009 markings, 431498 edges, 2170 markings/sec, 115 secs
lola: sara is running 120 secs || 426958 markings, 442697 edges, 2190 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 618 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= pil_d1_n1_2_3_2_2_2) AND (pil_d3_n1_1_1_1_3_3 <= pi_d1_n1_3_1_1_3_2)) OR (pb_d1_n2_2_1_2_2_2 + 1 <= po_d2_n1_2_1_1_3_2) OR ((pb_d3_n1_2_3_2_3_1 + 1 <= pil_d5_n1_1_1_1_2_2) AND (pil_d5_n1_1_1_2_1_3 + 1 <= pi_d3_n1_2_1_2_3_2)))))
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 ((((2 <= pil_d1_n1_2_3_2_2_2) AND (pil_d3_n1_1_1_1_3_3 <= pi_d1_n1_3_1_1_3_2)) OR (pb_d1_n2_2_1_2_2_2 + 1 <= po_d2_n1_2_1_1_3_2) OR ((pb_d3_n1_2_3_2_3_1 + 1 <= pil_d5_n1_1_1_1_2_2) AND (pil_d5_n1_1_1_2_1_3 + 1 <= pi_d3_n1_2_1_2_3_2)))))
lola: processed formula length: 243
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((2 <= pil_d1_n1_2_3_2_2_2) AND (pil_d3_n1_1_1_1_3_3 <= pi_d1_n1_3_1_1_3_2)) OR (pb_d1_n2_2_1_2_2_2 + 1 <= po_d2_n1_2_1_1_3_2) OR ((pb_d3_n1_2_3_2_3_1 + 1 <= pil_d5_n1_1_1_1_2_2) AND (pil_d5_n1_1_1_2_1_3 + 1 <= pi_d3_n1_2_1_2_3_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 13 will run for 824 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pb_d2_n2_2_2_2_1_1 <= po_d3_n1_3_3_2_2_2) OR (pi_d4_n1_3_3_1_1_3 <= pb_d2_n2_2_3_1_3_2) OR ((pil_d1_n1_1_2_3_2_2 <= po_d4_n1_1_1_3_3_2) AND (1 <= po_d2_n1_3_3_3_2_1))) AND (pb_d3_n2_1_3_3_3_3 + 1 <= pil_d4_n1_1_1_2_2_3))))
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 ((((pb_d2_n2_2_2_2_1_1 <= po_d3_n1_3_3_2_2_2) OR (pi_d4_n1_3_3_1_1_3 <= pb_d2_n2_2_3_1_3_2) OR ((pil_d1_n1_1_2_3_2_2 <= po_d4_n1_1_1_3_3_2) AND (1 <= po_d2_n1_3_3_3_2_1))) AND (pb_d3_n2_1_3_3_3_3 + 1 <= pil_d4_n1_1_1_2_2_3))))
lola: processed formula length: 233
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((pb_d2_n2_2_2_2_1_1 <= po_d3_n1_3_3_2_2_2) OR (pi_d4_n1_3_3_1_1_3 <= pb_d2_n2_2_3_1_3_2) OR ((pil_d1_n1_1_2_3_2_2 <= po_d4_n1_1_1_3_3_2) AND (1 <= po_d2_n1_3_3_3_2_1))) AND (pb_d3_n2_1_3_3_3_3 + 1 <= pil_d4_n1_1_1_2_2_3))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d2_n1_3_3_2_1_3 + 1 <= pi_d2_n1_1_2_1_3_2) AND (pil_d4_n1_3_2_3_3_3 + 1 <= pi_d3_n1_2_1_3_1_3) AND (3 <= pb_d4_n1_3_2_3_2_1) AND (pol_d2_n1_1_3_1_2_2 <= pil_d4_n1_2_2_3_1_2) AND ((3 <= po_d1_n1_1_2_3_2_2) OR (pi_d2_n1_1_1_1_3_1 <= pb_d3_n1_2_2_1_1_1)))))
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 (((pil_d2_n1_3_3_2_1_3 + 1 <= pi_d2_n1_1_2_1_3_2) AND (pil_d4_n1_3_2_3_3_3 + 1 <= pi_d3_n1_2_1_3_1_3) AND (3 <= pb_d4_n1_3_2_3_2_1) AND (pol_d2_n1_1_3_1_2_2 <= pil_d4_n1_2_2_3_1_2) AND ((3 <= po_d1_n1_1_2_3_2_2) OR (pi_d2_n1_1_1_1_3_1 <= pb_d3_n1_2_2_1_1_1)))))
lola: processed formula length: 267
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((pil_d2_n1_3_3_2_1_3 + 1 <= pi_d2_n1_1_2_1_3_2) AND (pil_d4_n1_3_2_3_3_3 + 1 <= pi_d3_n1_2_1_3_1_3) AND (3 <= pb_d4_n1_3_2_3_2_1) AND (pol_d2_n1_1_3_1_2_2 <= pil_d4_n1_2_2_3_1_2) AND ((3 <= po_d1_n1_1_2_3_2_2) OR (pi_d2_n1_1_1_1_3_1 <= pb_d3_n1_2_2_1_1_1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 2474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d3_n2_3_1_3_2_3 <= po_d4_n1_1_2_1_2_1) OR (pb_d2_n1_3_2_1_3_3 <= po_d4_n1_1_3_1_2_2) OR (pol_d5_n1_2_1_2_1_3 + 1 <= pb_d5_n2_3_1_2_3_1) OR (pil_d3_n1_3_2_2_1_2 <= pb_d2_n2_1_1_1_3_2) OR (3 <= pil_d2_n1_2_3_1_1_2) OR (pil_d3_n1_3_1_3_1_1 <= pb_d2_n1_2_1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((pb_d3_n2_3_1_3_2_3 <= po_d4_n1_1_2_1_2_1) OR (pb_d2_n1_3_2_1_3_3 <= po_d4_n1_1_3_1_2_2) OR (pol_d5_n1_2_1_2_1_3 + 1 <= pb_d5_n2_3_1_2_3_1) OR (pil_d3_n1_3_2_2_1_2 <= pb_d2_n2_1_1_1_3_2) OR (3 <= pil_d2_n1_2_3_1_1_2) OR (pil_d3_n1_3_1_3_1_1 <= pb_d2_n1_2_1_3_2_3))))
lola: processed formula length: 278
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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:721
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: ((po_d4_n1_1_2_1_2_1 + 1 <= pb_d3_n2_3_1_3_2_3) AND (po_d4_n1_1_3_1_2_2 + 1 <= pb_d2_n1_3_2_1_3_3) AND (pb_d5_n2_3_1_2_3_1 <= pol_d5_n1_2_1_2_1_3) AND (pb_d2_n2_1_1_1_3_2 + 1 <= pil_d3_n1_3_2_2_1_2) AND (pil_d2_n1_2_3_1_1_2 <= 2) AND (pb_d2_n1_2_1_3_2_3 + 1 <= pil_d3_n1_3_1_3_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: RESULT
lola:
SUMMARY: no no no yes yes yes no no no no yes yes no yes yes yes
lola:
preliminary result: no no no yes yes yes no no no no yes yes no yes yes yes
lola: ========================================
lola: memory consumption: 2364472 KB
lola: time consumption: 1096 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552684197153

--------------------
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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-csrt-155246550100818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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