Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r049-oct2-155234405500692.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 DNAwalker-PT-11ringRR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405500692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.0K Feb 10 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 10 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 6 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 23:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K Feb 4 23:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 3 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 06:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 30 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 30 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-11ringRR-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-11ringRR-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1552475002139

info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-11ringRR @ 3570 seconds

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DNAwalker-PT-11ringRR-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1044
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-11ringRR

{
"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": "Wed Mar 13 11:03:22 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 184
},
"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 ((A14 <= 2)))",
"processed_size": 18,
"rewrites": 2
},
"result":
{
"edges": 124214463,
"markings": 21951656,
"produced_by": "state space",
"value": true
},
"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": 185
},
"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 ((2 <= B20)))",
"processed_size": 18,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 1,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 197
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((3 <= A13) OR (A6 <= 2))))",
"processed_size": 34,
"rewrites": 2
},
"result":
{
"edges": 124348899,
"markings": 21582581,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"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": 199
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "E (F (((2 <= B21) AND ((A4 + 1 <= A9) OR (3 <= A13)))))",
"processed_size": 56,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 1,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 217
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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 (((B20 <= 2) AND ((A11 + 1 <= B21) OR (A21 <= 2)))))",
"processed_size": 58,
"rewrites": 2
},
"result":
{
"edges": 78932993,
"markings": 14745285,
"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": 3,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 227
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 4,
"visible_transitions": 0
},
"processed": "E (F (((2 <= A4) AND ((A12 <= A6) OR (1 <= A19)) AND (2 <= A6))))",
"processed_size": 66,
"rewrites": 1
},
"result":
{
"edges": 66717131,
"markings": 15471309,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 243
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "A (G (((A3 <= A2) OR (B13 <= 2) OR (A3 <= A7))))",
"processed_size": 50,
"rewrites": 2
},
"result":
{
"edges": 110632647,
"markings": 14611120,
"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": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 261
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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 (((3 <= B11) AND ((1 <= A20) OR (A16 <= A4)) AND (2 <= A11))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 1,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"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": "E (F (((A15 + 1 <= A9) AND (A7 + 1 <= B12) AND (A18 <= A8))))",
"processed_size": 61,
"rewrites": 1
},
"result":
{
"edges": 0,
"markings": 1,
"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": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 365
},
"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": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((A19 <= 1) OR (A10 <= A6) OR ((3 <= A16) AND (A16 <= B20) AND (A8 <= A12)))))",
"processed_size": 86,
"rewrites": 2
},
"result":
{
"edges": 30071829,
"markings": 5279088,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": 7,
"visible_transitions": 0
},
"processed": "E (F (((A1 <= B21) AND (A10 <= A15) AND ((3 <= A21) OR (A18 <= A15)) AND (3 <= A2))))",
"processed_size": 86,
"rewrites": 1
},
"result":
{
"edges": 163733992,
"markings": 27334429,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 516
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"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": 8,
"visible_transitions": 0
},
"processed": "A (G (((2 <= A15) OR (1 <= B20) OR (1 <= A19) OR (A12 <= A5) OR ((2 <= A15) AND (2 <= B11) AND (B12 <= B10)))))",
"processed_size": 115,
"rewrites": 2
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((1 <= A18) OR (A19 <= A3) OR ((A15 <= A6) AND (1 <= A9)) OR ((B21 <= A15) AND (A10 <= A8)))))",
"processed_size": 103,
"rewrites": 2
},
"result":
{
"edges": 2193592,
"markings": 475213,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F (((3 <= A3) AND ((A19 <= A7) OR (A10 <= A8)) AND ((A19 <= A7) OR (A2 <= A20) OR ((A16 <= B21) AND (A1 <= B13))))))",
"processed_size": 122,
"rewrites": 1
},
"result":
{
"edges": 126591943,
"markings": 23851876,
"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": 20,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((3 <= A7))))",
"processed_size": 19,
"rewrites": 1
},
"result":
{
"edges": 234577951,
"markings": 28209759,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 16,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 38760,
"runtime": 2502.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "yes yes no no no no yes no no no no no no no yes no ",
"value": "yes yes no no no no yes no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 287/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 260 transitions, 27 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 ((A14 <= 2))) : A (G (((B20 <= 2) AND ((A11 + 1 <= B21) OR (A21 <= 2))))) : E (F (((A15 + 1 <= A9) AND (A7 + 1 <= B12) AND (A18 <= A8)))) : A (G (((A19 <= 1) OR (A10 <= A6) OR ((3 <= A16) AND (A16 <= B20) AND (A8 <= A12))))) : E (F (((3 <= B11) AND ((1 <= A20) OR (A16 <= A4)) AND (2 <= A11)))) : E (F ((2 <= B20))) : A (G (((3 <= A13) OR (A6 <= 2)))) : A (G (((2 <= A15) OR (1 <= B20) OR (1 <= A19) OR (A12 <= A5) OR ((2 <= A15) AND (2 <= B11) AND (B12 <= B10))))) : E (F (((2 <= B21) AND ((A4 + 1 <= A9) OR (3 <= A13))))) : E (F (((3 <= A7)))) : E (F (((2 <= A4) AND ((A12 <= A6) OR (1 <= A19)) AND (2 <= A6)))) : E (F (((3 <= A3) AND ((A19 <= A7) OR (A10 <= A8)) AND ((A19 <= A7) OR (A2 <= A20) OR ((A16 <= B21) AND (A1 <= B13)))))) : E (F (((A1 <= B21) AND (A10 <= A15) AND ((3 <= A21) OR (A18 <= A15)) AND (3 <= A2)))) : A (G (((1 <= A18) OR (A19 <= A3) OR ((A15 <= A6) AND (1 <= A9)) OR ((B21 <= A15) AND (A10 <= A8))))) : A (G (((A3 <= A2) OR (B13 <= 2) OR (A3 <= A7)))) : E (F (((3 <= A7) AND (3 <= A7) AND ((1 <= A13) OR (1 <= A9)) AND (A6 <= 2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A14 <= 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 ((A14 <= 2)))
lola: processed formula length: 18
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: (3 <= A14)
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 ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 756230 markings, 3221708 edges, 151246 markings/sec, 0 secs
lola: sara is running 5 secs || 1586970 markings, 6509261 edges, 166148 markings/sec, 5 secs
lola: sara is running 10 secs || 2303694 markings, 10018831 edges, 143345 markings/sec, 10 secs
lola: sara is running 15 secs || 2964898 markings, 13760258 edges, 132241 markings/sec, 15 secs
lola: sara is running 20 secs || 3779725 markings, 17227375 edges, 162965 markings/sec, 20 secs
lola: sara is running 25 secs || 4463232 markings, 20896609 edges, 136701 markings/sec, 25 secs
lola: sara is running 30 secs || 5205649 markings, 24323202 edges, 148483 markings/sec, 30 secs
lola: sara is running 35 secs || 5889040 markings, 27866962 edges, 136678 markings/sec, 35 secs
lola: sara is running 40 secs || 6504325 markings, 31329242 edges, 123057 markings/sec, 40 secs
lola: sara is running 45 secs || 7113496 markings, 34998378 edges, 121834 markings/sec, 45 secs
lola: sara is running 50 secs || 7828086 markings, 38440833 edges, 142918 markings/sec, 50 secs
lola: sara is running 55 secs || 8493645 markings, 41978079 edges, 133112 markings/sec, 55 secs
lola: sara is running 60 secs || 9022296 markings, 45787256 edges, 105730 markings/sec, 60 secs
lola: sara is running 65 secs || 9736507 markings, 49331673 edges, 142842 markings/sec, 65 secs
lola: sara is running 70 secs || 10424312 markings, 53163303 edges, 137561 markings/sec, 70 secs
lola: sara is running 75 secs || 11083834 markings, 56874296 edges, 131904 markings/sec, 75 secs
lola: sara is running 80 secs || 11924888 markings, 60634068 edges, 168211 markings/sec, 80 secs
lola: sara is running 85 secs || 12584322 markings, 64619255 edges, 131887 markings/sec, 85 secs
lola: sara is running 90 secs || 13210770 markings, 68409587 edges, 125290 markings/sec, 90 secs
lola: sara is running 95 secs || 13815897 markings, 72344687 edges, 121025 markings/sec, 95 secs
lola: sara is running 100 secs || 14429542 markings, 76207424 edges, 122729 markings/sec, 100 secs
lola: sara is running 105 secs || 15008665 markings, 80256597 edges, 115825 markings/sec, 105 secs
lola: sara is running 110 secs || 15651748 markings, 83928636 edges, 128617 markings/sec, 110 secs
lola: sara is running 115 secs || 16260789 markings, 87421965 edges, 121808 markings/sec, 115 secs
lola: sara is running 120 secs || 16848611 markings, 91042560 edges, 117564 markings/sec, 120 secs
lola: sara is running 125 secs || 17410580 markings, 94679070 edges, 112394 markings/sec, 125 secs
lola: sara is running 130 secs || 17999239 markings, 98246414 edges, 117732 markings/sec, 130 secs
lola: sara is running 135 secs || 18602941 markings, 101809102 edges, 120740 markings/sec, 135 secs
lola: sara is running 140 secs || 19299532 markings, 105522296 edges, 139318 markings/sec, 140 secs
lola: sara is running 145 secs || 19881300 markings, 109375226 edges, 116354 markings/sec, 145 secs
lola: sara is running 150 secs || 20433667 markings, 113097174 edges, 110473 markings/sec, 150 secs
lola: sara is running 155 secs || 20970333 markings, 116975574 edges, 107333 markings/sec, 155 secs
lola: sara is running 160 secs || 21546167 markings, 120850957 edges, 115167 markings/sec, 160 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 21951656 markings, 124214463 edges
lola: ========================================
lola: subprocess 1 will run for 185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= B20)))
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 <= B20)))
lola: processed formula length: 18
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A7))))
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 (((3 <= A7))))
lola: processed formula length: 19
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: ((3 <= A7))
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 ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 552008 markings, 3674700 edges, 110402 markings/sec, 0 secs
lola: sara is running 5 secs || 1091647 markings, 7270909 edges, 107928 markings/sec, 5 secs
lola: sara is running 10 secs || 1624462 markings, 10874032 edges, 106563 markings/sec, 10 secs
lola: sara is running 15 secs || 2111032 markings, 14655678 edges, 97314 markings/sec, 15 secs
lola: sara is running 20 secs || 2561860 markings, 18591266 edges, 90166 markings/sec, 20 secs
lola: sara is running 25 secs || 3107423 markings, 21941388 edges, 109113 markings/sec, 25 secs
lola: sara is running 30 secs || 3628760 markings, 25541373 edges, 104267 markings/sec, 30 secs
lola: sara is running 35 secs || 4113640 markings, 29293958 edges, 96976 markings/sec, 35 secs
lola: sara is running 40 secs || 4589285 markings, 33087708 edges, 95129 markings/sec, 40 secs
lola: sara is running 45 secs || 5054460 markings, 36940756 edges, 93035 markings/sec, 45 secs
lola: sara is running 50 secs || 5492750 markings, 40909315 edges, 87658 markings/sec, 50 secs
lola: sara is running 55 secs || 5915537 markings, 44918873 edges, 84557 markings/sec, 55 secs
lola: sara is running 60 secs || 6428461 markings, 48634537 edges, 102585 markings/sec, 60 secs
lola: sara is running 65 secs || 6924208 markings, 52450105 edges, 99149 markings/sec, 65 secs
lola: sara is running 70 secs || 7413354 markings, 56188197 edges, 97829 markings/sec, 70 secs
lola: sara is running 75 secs || 7909922 markings, 59761270 edges, 99314 markings/sec, 75 secs
lola: sara is running 80 secs || 8350481 markings, 63562620 edges, 88112 markings/sec, 80 secs
lola: sara is running 85 secs || 8783362 markings, 67448987 edges, 86576 markings/sec, 85 secs
lola: sara is running 90 secs || 9257009 markings, 71410473 edges, 94729 markings/sec, 90 secs
lola: sara is running 95 secs || 9732429 markings, 75430697 edges, 95084 markings/sec, 95 secs
lola: sara is running 100 secs || 10209348 markings, 79303939 edges, 95384 markings/sec, 100 secs
lola: sara is running 105 secs || 10641719 markings, 83159478 edges, 86474 markings/sec, 105 secs
lola: sara is running 110 secs || 11122870 markings, 87087966 edges, 96230 markings/sec, 110 secs
lola: sara is running 115 secs || 11564913 markings, 91298718 edges, 88409 markings/sec, 115 secs
lola: sara is running 120 secs || 12002733 markings, 95311185 edges, 87564 markings/sec, 120 secs
lola: sara is running 125 secs || 12440074 markings, 99175036 edges, 87468 markings/sec, 125 secs
lola: sara is running 130 secs || 12909941 markings, 102548156 edges, 93973 markings/sec, 130 secs
lola: sara is running 135 secs || 13389872 markings, 106166083 edges, 95986 markings/sec, 135 secs
lola: sara is running 140 secs || 13854328 markings, 109925023 edges, 92891 markings/sec, 140 secs
lola: sara is running 145 secs || 14341237 markings, 113557006 edges, 97382 markings/sec, 145 secs
lola: sara is running 150 secs || 14823564 markings, 116992703 edges, 96465 markings/sec, 150 secs
lola: sara is running 155 secs || 15254294 markings, 120656176 edges, 86146 markings/sec, 155 secs
lola: sara is running 160 secs || 15658195 markings, 124218571 edges, 80780 markings/sec, 160 secs
lola: sara is running 165 secs || 16142637 markings, 127674604 edges, 96888 markings/sec, 165 secs
lola: sara is running 170 secs || 16601235 markings, 130897630 edges, 91720 markings/sec, 170 secs
lola: sara is running 175 secs || 17003661 markings, 134457639 edges, 80485 markings/sec, 175 secs
lola: sara is running 180 secs || 17434804 markings, 137727571 edges, 86229 markings/sec, 180 secs
lola: sara is running 185 secs || 17812971 markings, 141218390 edges, 75633 markings/sec, 185 secs
lola: sara is running 190 secs || 18205545 markings, 144658828 edges, 78515 markings/sec, 190 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 664420 KB
lola: time consumption: 982 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: yes unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 667544 KB
lola: time consumption: 983 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= A13) OR (A6 <= 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 (((3 <= A13) OR (A6 <= 2))))
lola: processed formula length: 34
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: ((A13 <= 2) AND (3 <= A6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 762713 markings, 3347825 edges, 152543 markings/sec, 0 secs
lola: sara is running 5 secs || 1474663 markings, 6950688 edges, 142390 markings/sec, 5 secs
lola: sara is running 10 secs || 2215584 markings, 10499638 edges, 148184 markings/sec, 10 secs
lola: sara is running 15 secs || 2876712 markings, 14301358 edges, 132226 markings/sec, 15 secs
lola: sara is running 20 secs || 3514330 markings, 18030794 edges, 127524 markings/sec, 20 secs
lola: sara is running 25 secs || 4053103 markings, 21847505 edges, 107755 markings/sec, 25 secs
lola: sara is running 30 secs || 4722677 markings, 25435637 edges, 133915 markings/sec, 30 secs
lola: sara is running 35 secs || 5347021 markings, 29048140 edges, 124869 markings/sec, 35 secs
lola: sara is running 40 secs || 5963580 markings, 32583584 edges, 123312 markings/sec, 40 secs
lola: sara is running 45 secs || 6563135 markings, 36153398 edges, 119911 markings/sec, 45 secs
lola: sara is running 50 secs || 7130654 markings, 39898221 edges, 113504 markings/sec, 50 secs
lola: sara is running 55 secs || 7787075 markings, 43532957 edges, 131284 markings/sec, 55 secs
lola: sara is running 60 secs || 8448938 markings, 47127410 edges, 132373 markings/sec, 60 secs
lola: sara is running 65 secs || 9005759 markings, 50789437 edges, 111364 markings/sec, 65 secs
lola: sara is running 70 secs || 9625238 markings, 54261482 edges, 123896 markings/sec, 70 secs
lola: sara is running 75 secs || 10288027 markings, 57530133 edges, 132558 markings/sec, 75 secs
lola: sara is running 80 secs || 10976742 markings, 61070753 edges, 137743 markings/sec, 80 secs
lola: sara is running 85 secs || 11522389 markings, 64630489 edges, 109129 markings/sec, 85 secs
lola: sara is running 90 secs || 12125160 markings, 68148103 edges, 120554 markings/sec, 90 secs
lola: sara is running 95 secs || 12609052 markings, 71815814 edges, 96778 markings/sec, 95 secs
lola: sara is running 100 secs || 13296088 markings, 75459321 edges, 137407 markings/sec, 100 secs
lola: sara is running 105 secs || 13934461 markings, 79069444 edges, 127675 markings/sec, 105 secs
lola: sara is running 110 secs || 14586707 markings, 82430415 edges, 130449 markings/sec, 110 secs
lola: sara is running 115 secs || 15175841 markings, 85858429 edges, 117827 markings/sec, 115 secs
lola: sara is running 120 secs || 15678693 markings, 89366010 edges, 100570 markings/sec, 120 secs
lola: sara is running 125 secs || 16302422 markings, 92798831 edges, 124746 markings/sec, 125 secs
lola: sara is running 130 secs || 16978331 markings, 96265239 edges, 135182 markings/sec, 130 secs
lola: sara is running 135 secs || 17726875 markings, 99755366 edges, 149709 markings/sec, 135 secs
lola: sara is running 140 secs || 18357172 markings, 103321141 edges, 126059 markings/sec, 140 secs
lola: sara is running 145 secs || 19002759 markings, 107140015 edges, 129117 markings/sec, 145 secs
lola: sara is running 150 secs || 19580432 markings, 110737918 edges, 115535 markings/sec, 150 secs
lola: sara is running 155 secs || 20211600 markings, 114381131 edges, 126234 markings/sec, 155 secs
lola: sara is running 160 secs || 20758661 markings, 118202398 edges, 109412 markings/sec, 160 secs
lola: sara is running 165 secs || 21293442 markings, 122036556 edges, 106956 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 21582581 markings, 124348899 edges
lola: ========================================
lola: subprocess 4 will run for 199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= B21) AND ((A4 + 1 <= A9) OR (3 <= A13)))))
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 <= B21) AND ((A4 + 1 <= A9) OR (3 <= A13)))))
lola: processed formula length: 56
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: formula 0: ((2 <= B21) AND ((A4 + 1 <= A9) OR (3 <= A13)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((B20 <= 2) AND ((A11 + 1 <= B21) OR (A21 <= 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 (((B20 <= 2) AND ((A11 + 1 <= B21) OR (A21 <= 2)))))
lola: processed formula length: 58
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: ((3 <= B20) OR ((B21 <= A11) AND (3 <= A21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-5-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 783697 markings, 2970827 edges, 156739 markings/sec, 0 secs
lola: sara is running 5 secs || 1537622 markings, 6256041 edges, 150785 markings/sec, 5 secs
lola: sara is running 10 secs || 2326850 markings, 9498821 edges, 157846 markings/sec, 10 secs
lola: sara is running 15 secs || 3030975 markings, 12876936 edges, 140825 markings/sec, 15 secs
lola: sara is running 20 secs || 3767204 markings, 16281078 edges, 147246 markings/sec, 20 secs
lola: sara is running 25 secs || 4380095 markings, 19879323 edges, 122578 markings/sec, 25 secs
lola: sara is running 30 secs || 5053599 markings, 23294174 edges, 134701 markings/sec, 30 secs
lola: sara is running 35 secs || 5707311 markings, 26848744 edges, 130742 markings/sec, 35 secs
lola: sara is running 40 secs || 6468223 markings, 30333803 edges, 152182 markings/sec, 40 secs
lola: sara is running 45 secs || 7140176 markings, 33694330 edges, 134391 markings/sec, 45 secs
lola: sara is running 50 secs || 7738292 markings, 37078617 edges, 119623 markings/sec, 50 secs
lola: sara is running 55 secs || 8321194 markings, 40443050 edges, 116580 markings/sec, 55 secs
lola: sara is running 60 secs || 8914681 markings, 43940215 edges, 118697 markings/sec, 60 secs
lola: sara is running 65 secs || 9510130 markings, 47417140 edges, 119090 markings/sec, 65 secs
lola: sara is running 70 secs || 10204464 markings, 50920010 edges, 138867 markings/sec, 70 secs
lola: sara is running 75 secs || 10875224 markings, 54490436 edges, 134152 markings/sec, 75 secs
lola: sara is running 80 secs || 11508167 markings, 58109141 edges, 126589 markings/sec, 80 secs
lola: sara is running 85 secs || 12076989 markings, 61773887 edges, 113764 markings/sec, 85 secs
lola: sara is running 90 secs || 12670692 markings, 65574810 edges, 118741 markings/sec, 90 secs
lola: sara is running 95 secs || 13320202 markings, 69288417 edges, 129902 markings/sec, 95 secs
lola: sara is running 100 secs || 13862257 markings, 72948090 edges, 108411 markings/sec, 100 secs
lola: sara is running 105 secs || 14407981 markings, 76830365 edges, 109145 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 14745285 markings, 78932993 edges
lola: ========================================
lola: subprocess 6 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= A4) AND ((A12 <= A6) OR (1 <= A19)) AND (2 <= A6))))
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 <= A4) AND ((A12 <= A6) OR (1 <= A19)) AND (2 <= A6))))
lola: processed formula length: 66
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 <= A4) AND ((A12 <= A6) OR (1 <= A19)) AND (2 <= A6))
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 988205 markings, 3553412 edges, 197641 markings/sec, 0 secs
lola: sara is running 5 secs || 1838024 markings, 7121335 edges, 169964 markings/sec, 5 secs
lola: sara is running 10 secs || 2617494 markings, 10946183 edges, 155894 markings/sec, 10 secs
lola: sara is running 15 secs || 3513645 markings, 14672919 edges, 179230 markings/sec, 15 secs
lola: sara is running 20 secs || 4374726 markings, 18465722 edges, 172216 markings/sec, 20 secs
lola: sara is running 25 secs || 5348154 markings, 22093972 edges, 194686 markings/sec, 25 secs
lola: sara is running 30 secs || 6148551 markings, 25869850 edges, 160079 markings/sec, 30 secs
lola: sara is running 35 secs || 7000332 markings, 29514571 edges, 170356 markings/sec, 35 secs
lola: sara is running 40 secs || 7892371 markings, 33003744 edges, 178408 markings/sec, 40 secs
lola: sara is running 45 secs || 8793434 markings, 36654229 edges, 180213 markings/sec, 45 secs
lola: sara is running 50 secs || 9618632 markings, 40149537 edges, 165040 markings/sec, 50 secs
lola: sara is running 55 secs || 10585095 markings, 43583277 edges, 193293 markings/sec, 55 secs
lola: sara is running 60 secs || 11492463 markings, 47231103 edges, 181474 markings/sec, 60 secs
lola: sara is running 65 secs || 12276259 markings, 50917100 edges, 156759 markings/sec, 65 secs
lola: sara is running 70 secs || 13061160 markings, 54701346 edges, 156980 markings/sec, 70 secs
lola: sara is running 75 secs || 13831731 markings, 58332136 edges, 154114 markings/sec, 75 secs
lola: sara is running 80 secs || 14640463 markings, 62119828 edges, 161746 markings/sec, 80 secs
lola: sara is running 85 secs || 15350191 markings, 66024435 edges, 141946 markings/sec, 85 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 15471309 markings, 66717131 edges
lola: ========================================
lola: subprocess 7 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A3 <= A2) OR (B13 <= 2) OR (A3 <= A7))))
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 (((A3 <= A2) OR (B13 <= 2) OR (A3 <= A7))))
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: ((A2 + 1 <= A3) AND (3 <= B13) AND (A7 + 1 <= A3))
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 ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 679089 markings, 3600865 edges, 135818 markings/sec, 0 secs
lola: sara is running 5 secs || 1280790 markings, 7418864 edges, 120340 markings/sec, 5 secs
lola: sara is running 10 secs || 1893449 markings, 11085926 edges, 122532 markings/sec, 10 secs
lola: sara is running 15 secs || 2466426 markings, 15049248 edges, 114595 markings/sec, 15 secs
lola: sara is running 20 secs || 2993856 markings, 19156505 edges, 105486 markings/sec, 20 secs
lola: sara is running 25 secs || 3552679 markings, 23205154 edges, 111765 markings/sec, 25 secs
lola: sara is running 30 secs || 4091397 markings, 27147348 edges, 107744 markings/sec, 30 secs
lola: sara is running 35 secs || 4564144 markings, 31288410 edges, 94549 markings/sec, 35 secs
lola: sara is running 40 secs || 5088150 markings, 35358551 edges, 104801 markings/sec, 40 secs
lola: sara is running 45 secs || 5586821 markings, 39491384 edges, 99734 markings/sec, 45 secs
lola: sara is running 50 secs || 6086111 markings, 43597812 edges, 99858 markings/sec, 50 secs
lola: sara is running 55 secs || 6615308 markings, 47507383 edges, 105839 markings/sec, 55 secs
lola: sara is running 60 secs || 7206316 markings, 51300895 edges, 118202 markings/sec, 60 secs
lola: sara is running 65 secs || 7749256 markings, 55358971 edges, 108588 markings/sec, 65 secs
lola: sara is running 70 secs || 8305255 markings, 59339837 edges, 111200 markings/sec, 70 secs
lola: sara is running 75 secs || 8851576 markings, 63320134 edges, 109264 markings/sec, 75 secs
lola: sara is running 80 secs || 9350860 markings, 67400461 edges, 99857 markings/sec, 80 secs
lola: sara is running 85 secs || 9838272 markings, 71540159 edges, 97482 markings/sec, 85 secs
lola: sara is running 90 secs || 10383636 markings, 75482328 edges, 109073 markings/sec, 90 secs
lola: sara is running 95 secs || 10915757 markings, 79482753 edges, 106424 markings/sec, 95 secs
lola: sara is running 100 secs || 11438966 markings, 83369122 edges, 104642 markings/sec, 100 secs
lola: sara is running 105 secs || 11977434 markings, 87274727 edges, 107694 markings/sec, 105 secs
lola: sara is running 110 secs || 12503245 markings, 91325638 edges, 105162 markings/sec, 110 secs
lola: sara is running 115 secs || 12972905 markings, 95592480 edges, 93932 markings/sec, 115 secs
lola: sara is running 120 secs || 13459910 markings, 99701494 edges, 97401 markings/sec, 120 secs
lola: sara is running 125 secs || 13940498 markings, 103939218 edges, 96118 markings/sec, 125 secs
lola: sara is running 130 secs || 14386011 markings, 108290674 edges, 89103 markings/sec, 130 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 14611120 markings, 110632647 edges
lola: ========================================
lola: subprocess 8 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A7) AND (3 <= A7) AND ((1 <= A13) OR (1 <= A9)) AND (A6 <= 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 (((3 <= A7) AND (3 <= A7) AND ((1 <= A13) OR (1 <= A9)) AND (A6 <= 2))))
lola: processed formula length: 78
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: ((3 <= A7) AND (3 <= A7) AND ((1 <= A13) OR (1 <= A9)) AND (A6 <= 2))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 736954 markings, 3386462 edges, 147391 markings/sec, 0 secs
lola: sara is running 5 secs || 1372959 markings, 7114850 edges, 127201 markings/sec, 5 secs
lola: sara is running 10 secs || 1985444 markings, 11062424 edges, 122497 markings/sec, 10 secs
lola: sara is running 15 secs || 2618561 markings, 14752072 edges, 126623 markings/sec, 15 secs
lola: sara is running 20 secs || 3289284 markings, 18268337 edges, 134145 markings/sec, 20 secs
lola: sara is running 25 secs || 3930851 markings, 21971766 edges, 128313 markings/sec, 25 secs
lola: sara is running 30 secs || 4532520 markings, 25854559 edges, 120334 markings/sec, 30 secs
lola: sara is running 35 secs || 5104581 markings, 29844080 edges, 114412 markings/sec, 35 secs
lola: sara is running 40 secs || 5715095 markings, 33748629 edges, 122103 markings/sec, 40 secs
lola: sara is running 45 secs || 6325491 markings, 37515605 edges, 122079 markings/sec, 45 secs
lola: sara is running 50 secs || 6946726 markings, 41184035 edges, 124247 markings/sec, 50 secs
lola: sara is running 55 secs || 7565065 markings, 44984987 edges, 123668 markings/sec, 55 secs
lola: sara is running 60 secs || 8123235 markings, 49014894 edges, 111634 markings/sec, 60 secs
lola: sara is running 65 secs || 8734347 markings, 52920331 edges, 122222 markings/sec, 65 secs
lola: sara is running 70 secs || 9362481 markings, 56688628 edges, 125627 markings/sec, 70 secs
lola: sara is running 75 secs || 9904592 markings, 60618324 edges, 108422 markings/sec, 75 secs
lola: sara is running 80 secs || 10448217 markings, 64735571 edges, 108725 markings/sec, 80 secs
lola: sara is running 85 secs || 11081252 markings, 68637461 edges, 126607 markings/sec, 85 secs
lola: sara is running 90 secs || 11690485 markings, 72444643 edges, 121847 markings/sec, 90 secs
lola: sara is running 95 secs || 12451786 markings, 75866619 edges, 152260 markings/sec, 95 secs
lola: sara is running 100 secs || 12996777 markings, 79501484 edges, 108998 markings/sec, 100 secs
lola: sara is running 105 secs || 13528392 markings, 83291843 edges, 106323 markings/sec, 105 secs
lola: sara is running 110 secs || 14008230 markings, 87354137 edges, 95968 markings/sec, 110 secs
lola: sara is running 115 secs || 14704656 markings, 90641083 edges, 139285 markings/sec, 115 secs
lola: sara is running 120 secs || 15239804 markings, 94449941 edges, 107030 markings/sec, 120 secs
lola: sara is running 125 secs || 15836938 markings, 98176602 edges, 119427 markings/sec, 125 secs
lola: sara is running 130 secs || 16407214 markings, 102026951 edges, 114055 markings/sec, 130 secs
lola: sara is running 135 secs || 16934644 markings, 105802515 edges, 105486 markings/sec, 135 secs
lola: sara is running 140 secs || 17460456 markings, 109835661 edges, 105162 markings/sec, 140 secs
lola: sara is running 145 secs || 18287191 markings, 113228971 edges, 165347 markings/sec, 145 secs
lola: sara is running 150 secs || 19083383 markings, 116739039 edges, 159238 markings/sec, 150 secs
lola: sara is running 155 secs || 19770830 markings, 120222769 edges, 137489 markings/sec, 155 secs
lola: sara is running 160 secs || 20291027 markings, 123946228 edges, 104039 markings/sec, 160 secs
lola: sara is running 165 secs || 20790170 markings, 127822380 edges, 99829 markings/sec, 165 secs
lola: sara is running 170 secs || 21302931 markings, 131533372 edges, 102552 markings/sec, 170 secs
lola: sara is running 175 secs || 21834144 markings, 135198193 edges, 106243 markings/sec, 175 secs
lola: sara is running 180 secs || 22413188 markings, 139063148 edges, 115809 markings/sec, 180 secs
lola: sara is running 185 secs || 22930486 markings, 142986969 edges, 103460 markings/sec, 185 secs
lola: sara is running 190 secs || 23438179 markings, 147005362 edges, 101539 markings/sec, 190 secs
lola: sara is running 195 secs || 23919551 markings, 151012259 edges, 96274 markings/sec, 195 secs
lola: sara is running 200 secs || 24378985 markings, 154986193 edges, 91887 markings/sec, 200 secs
lola: sara is running 205 secs || 24885081 markings, 159042800 edges, 101219 markings/sec, 205 secs
lola: sara is running 210 secs || 25335316 markings, 163176851 edges, 90047 markings/sec, 210 secs
lola: sara is running 215 secs || 25775152 markings, 167433580 edges, 87967 markings/sec, 215 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 25815986 markings, 167813910 edges
lola: ========================================
lola: subprocess 9 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= B11) AND ((1 <= A20) OR (A16 <= A4)) AND (2 <= A11))))
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 (((3 <= B11) AND ((1 <= A20) OR (A16 <= A4)) AND (2 <= A11))))
lola: processed formula length: 68
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A15 + 1 <= A9) AND (A7 + 1 <= B12) AND (A18 <= A8))))
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 (((A15 + 1 <= A9) AND (A7 + 1 <= B12) AND (A18 <= A8))))
lola: processed formula length: 61
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: ((A15 + 1 <= A9) AND (A7 + 1 <= B12) AND (A18 <= A8))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A19 <= 1) OR (A10 <= A6) OR ((3 <= A16) AND (A16 <= B20) AND (A8 <= A12)))))
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 (((A19 <= 1) OR (A10 <= A6) OR ((3 <= A16) AND (A16 <= B20) AND (A8 <= A12)))))
lola: processed formula length: 86
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 <= A19) AND (A6 + 1 <= A10) AND ((A16 <= 2) OR (B20 + 1 <= A16) OR (A12 + 1 <= A8)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 literals and 3 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.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 745883 markings, 3347914 edges, 149177 markings/sec, 0 secs
lola: sara is running 5 secs || 1452969 markings, 6803867 edges, 141417 markings/sec, 5 secs
lola: sara is running 10 secs || 2115233 markings, 10421345 edges, 132453 markings/sec, 10 secs
lola: sara is running 15 secs || 2777057 markings, 13938063 edges, 132365 markings/sec, 15 secs
lola: sara is running 20 secs || 3364662 markings, 17675670 edges, 117521 markings/sec, 20 secs
lola: sara is running 25 secs || 3966484 markings, 21355972 edges, 120364 markings/sec, 25 secs
lola: sara is running 30 secs || 4566342 markings, 24906337 edges, 119972 markings/sec, 30 secs
lola: sara is running 35 secs || 5104952 markings, 28665754 edges, 107722 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5279088 markings, 30071829 edges
lola: ========================================
lola: subprocess 12 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A1 <= B21) AND (A10 <= A15) AND ((3 <= A21) OR (A18 <= A15)) AND (3 <= A2))))
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 (((A1 <= B21) AND (A10 <= A15) AND ((3 <= A21) OR (A18 <= A15)) AND (3 <= A2))))
lola: processed formula length: 86
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: ((A1 <= B21) AND (A10 <= A15) AND ((3 <= A21) OR (A18 <= A15)) AND (3 <= A2))
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 773935 markings, 3462669 edges, 154787 markings/sec, 0 secs
lola: sara is running 5 secs || 1437158 markings, 6868275 edges, 132645 markings/sec, 5 secs
lola: sara is running 10 secs || 2076617 markings, 10133711 edges, 127892 markings/sec, 10 secs
lola: sara is running 15 secs || 2686300 markings, 13591100 edges, 121937 markings/sec, 15 secs
lola: sara is running 20 secs || 3345937 markings, 17150449 edges, 131927 markings/sec, 20 secs
lola: sara is running 25 secs || 3968449 markings, 20601145 edges, 124502 markings/sec, 25 secs
lola: sara is running 30 secs || 4581039 markings, 24029340 edges, 122518 markings/sec, 30 secs
lola: sara is running 35 secs || 5187098 markings, 27609854 edges, 121212 markings/sec, 35 secs
lola: sara is running 40 secs || 5838862 markings, 30971122 edges, 130353 markings/sec, 40 secs
lola: sara is running 45 secs || 6466638 markings, 34128505 edges, 125555 markings/sec, 45 secs
lola: sara is running 50 secs || 7063381 markings, 37458663 edges, 119349 markings/sec, 50 secs
lola: sara is running 55 secs || 7654220 markings, 40759885 edges, 118168 markings/sec, 55 secs
lola: sara is running 60 secs || 8235097 markings, 44224903 edges, 116175 markings/sec, 60 secs
lola: sara is running 65 secs || 8810735 markings, 47462107 edges, 115128 markings/sec, 65 secs
lola: sara is running 70 secs || 9432750 markings, 50906160 edges, 124403 markings/sec, 70 secs
lola: sara is running 75 secs || 10066307 markings, 54043571 edges, 126711 markings/sec, 75 secs
lola: sara is running 80 secs || 10596698 markings, 57174799 edges, 106078 markings/sec, 80 secs
lola: sara is running 85 secs || 11112150 markings, 60518883 edges, 103090 markings/sec, 85 secs
lola: sara is running 90 secs || 11591567 markings, 63624998 edges, 95883 markings/sec, 90 secs
lola: sara is running 95 secs || 11999445 markings, 66780723 edges, 81576 markings/sec, 95 secs
lola: sara is running 100 secs || 12728423 markings, 70355266 edges, 145796 markings/sec, 100 secs
lola: sara is running 105 secs || 13383720 markings, 73950094 edges, 131059 markings/sec, 105 secs
lola: sara is running 110 secs || 14007697 markings, 77566735 edges, 124795 markings/sec, 110 secs
lola: sara is running 115 secs || 14618272 markings, 81040362 edges, 122115 markings/sec, 115 secs
lola: sara is running 120 secs || 15253069 markings, 84414958 edges, 126959 markings/sec, 120 secs
lola: sara is running 125 secs || 15852461 markings, 87962394 edges, 119878 markings/sec, 125 secs
lola: sara is running 130 secs || 16428847 markings, 91339207 edges, 115277 markings/sec, 130 secs
lola: sara is running 135 secs || 17035473 markings, 94659859 edges, 121325 markings/sec, 135 secs
lola: sara is running 140 secs || 17538518 markings, 97922143 edges, 100609 markings/sec, 140 secs
lola: sara is running 145 secs || 17969950 markings, 101042536 edges, 86286 markings/sec, 145 secs
lola: sara is running 150 secs || 18592226 markings, 104498354 edges, 124455 markings/sec, 150 secs
lola: sara is running 155 secs || 19186829 markings, 107995222 edges, 118921 markings/sec, 155 secs
lola: sara is running 160 secs || 19786046 markings, 111420377 edges, 119843 markings/sec, 160 secs
lola: sara is running 165 secs || 20344516 markings, 114837539 edges, 111694 markings/sec, 165 secs
lola: sara is running 170 secs || 20894746 markings, 118296993 edges, 110046 markings/sec, 170 secs
lola: sara is running 175 secs || 21427687 markings, 121652142 edges, 106588 markings/sec, 175 secs
lola: sara is running 180 secs || 22020999 markings, 125035487 edges, 118662 markings/sec, 180 secs
lola: sara is running 185 secs || 22584734 markings, 128516952 edges, 112747 markings/sec, 185 secs
lola: sara is running 190 secs || 23140702 markings, 131974676 edges, 111194 markings/sec, 190 secs
lola: sara is running 195 secs || 23710469 markings, 135323809 edges, 113953 markings/sec, 195 secs
lola: sara is running 200 secs || 24244502 markings, 138748363 edges, 106807 markings/sec, 200 secs
lola: sara is running 205 secs || 24782953 markings, 142160599 edges, 107690 markings/sec, 205 secs
lola: sara is running 210 secs || 25245774 markings, 145553357 edges, 92564 markings/sec, 210 secs
lola: sara is running 215 secs || 25739482 markings, 149216211 edges, 98742 markings/sec, 215 secs
lola: sara is running 220 secs || 26160277 markings, 153058224 edges, 84159 markings/sec, 220 secs
lola: sara is running 225 secs || 26577329 markings, 156893621 edges, 83410 markings/sec, 225 secs
lola: sara is running 230 secs || 27010450 markings, 160909379 edges, 86624 markings/sec, 230 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 27334429 markings, 163733992 edges
lola: ========================================
lola: subprocess 13 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= A15) OR (1 <= B20) OR (1 <= A19) OR (A12 <= A5) OR ((2 <= A15) AND (2 <= B11) AND (B12 <= B10)))))
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 (((2 <= A15) OR (1 <= B20) OR (1 <= A19) OR (A12 <= A5) OR ((2 <= A15) AND (2 <= B11) AND (B12 <= B10)))))
lola: processed formula length: 115
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: ((A15 <= 1) AND (B20 <= 0) AND (A19 <= 0) AND (A5 + 1 <= A12) AND ((A15 <= 1) OR (B11 <= 1) OR (B10 + 1 <= B12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to ReachabilityCardinality-13-0.sara
lola: subprocess 14 will run for 774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= A18) OR (A19 <= A3) OR ((A15 <= A6) AND (1 <= A9)) OR ((B21 <= A15) AND (A10 <= A8)))))
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 <= A18) OR (A19 <= A3) OR ((A15 <= A6) AND (1 <= A9)) OR ((B21 <= A15) AND (A10 <= A8)))))
lola: processed formula length: 103
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: ((A18 <= 0) AND (A3 + 1 <= A19) AND ((A6 + 1 <= A15) OR (A9 <= 0)) AND ((A15 + 1 <= B21) OR (A8 + 1 <= A10)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation: calling and running sara
lola: state equation:solution unknown
sara: try reading problem file ReachabilityCardinality-13-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 475213 markings, 2193592 edges
lola: ========================================
lola: subprocess 15 will run for 1545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A3) AND ((A19 <= A7) OR (A10 <= A8)) AND ((A19 <= A7) OR (A2 <= A20) OR ((A16 <= B21) AND (A1 <= B13))))))
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 (((3 <= A3) AND ((A19 <= A7) OR (A10 <= A8)) AND ((A19 <= A7) OR (A2 <= A20) OR ((A16 <= B21) AND (A1 <= B13))))))
lola: processed formula length: 122
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: ((3 <= A3) AND ((A19 <= A7) OR (A10 <= A8)) AND ((A19 <= A7) OR (A2 <= A20) OR ((A16 <= B21) AND (A1 <= B13))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 903383 markings, 3463424 edges, 180677 markings/sec, 0 secs
lola: sara is running 5 secs || 1649205 markings, 7120688 edges, 149164 markings/sec, 5 secs
lola: sara is running 10 secs || 2465343 markings, 10694855 edges, 163228 markings/sec, 10 secs
lola: sara is running 15 secs || 3245829 markings, 14238878 edges, 156097 markings/sec, 15 secs
lola: sara is running 20 secs || 4013932 markings, 18049669 edges, 153621 markings/sec, 20 secs
lola: sara is running 25 secs || 4714063 markings, 21969921 edges, 140026 markings/sec, 25 secs
lola: sara is running 30 secs || 5465235 markings, 25865690 edges, 150234 markings/sec, 30 secs
lola: sara is running 35 secs || 6166797 markings, 29777206 edges, 140312 markings/sec, 35 secs
lola: sara is running 40 secs || 6790181 markings, 33791626 edges, 124677 markings/sec, 40 secs
lola: sara is running 45 secs || 7455111 markings, 37952688 edges, 132986 markings/sec, 45 secs
lola: sara is running 50 secs || 8149696 markings, 41985020 edges, 138917 markings/sec, 50 secs
lola: sara is running 55 secs || 8845880 markings, 46227935 edges, 139237 markings/sec, 55 secs
lola: sara is running 60 secs || 9635189 markings, 50232555 edges, 157862 markings/sec, 60 secs
lola: sara is running 65 secs || 10436587 markings, 54065681 edges, 160280 markings/sec, 65 secs
lola: sara is running 70 secs || 11284876 markings, 57647968 edges, 169658 markings/sec, 70 secs
lola: sara is running 75 secs || 12057403 markings, 61521721 edges, 154505 markings/sec, 75 secs
lola: sara is running 80 secs || 12776377 markings, 65430108 edges, 143795 markings/sec, 80 secs
lola: sara is running 85 secs || 13552819 markings, 69074408 edges, 155288 markings/sec, 85 secs
lola: sara is running 90 secs || 14254197 markings, 72970806 edges, 140276 markings/sec, 90 secs
lola: sara is running 95 secs || 14852199 markings, 76961362 edges, 119600 markings/sec, 95 secs
lola: sara is running 100 secs || 15568387 markings, 80959368 edges, 143238 markings/sec, 100 secs
lola: sara is running 105 secs || 16388463 markings, 84768009 edges, 164015 markings/sec, 105 secs
lola: sara is running 110 secs || 17114849 markings, 88665381 edges, 145277 markings/sec, 110 secs
lola: sara is running 115 secs || 17721709 markings, 92608628 edges, 121372 markings/sec, 115 secs
lola: sara is running 120 secs || 18431089 markings, 96289181 edges, 141876 markings/sec, 120 secs
lola: sara is running 125 secs || 19324343 markings, 100074490 edges, 178651 markings/sec, 125 secs
lola: sara is running 130 secs || 20135865 markings, 103916809 edges, 162304 markings/sec, 130 secs
lola: sara is running 135 secs || 20846050 markings, 107942638 edges, 142037 markings/sec, 135 secs
lola: sara is running 140 secs || 21527702 markings, 111935471 edges, 136330 markings/sec, 140 secs
lola: sara is running 145 secs || 22123077 markings, 115885464 edges, 119075 markings/sec, 145 secs
lola: sara is running 150 secs || 22862690 markings, 119885921 edges, 147923 markings/sec, 150 secs
lola: sara is running 155 secs || 23491401 markings, 124038646 edges, 125742 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 23851876 markings, 126591943 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= A7))))
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 (((3 <= A7))))
lola: processed formula length: 19
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: ((3 <= A7))
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 ReachabilityCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-16-0.sara.
sara: error: :684: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 561437 markings, 3719076 edges, 112287 markings/sec, 0 secs
lola: sara is running 5 secs || 1098572 markings, 7331425 edges, 107427 markings/sec, 5 secs
lola: sara is running 10 secs || 1632851 markings, 10941412 edges, 106856 markings/sec, 10 secs
lola: sara is running 15 secs || 2131603 markings, 14843729 edges, 99750 markings/sec, 15 secs
lola: sara is running 20 secs || 2596936 markings, 18855440 edges, 93067 markings/sec, 20 secs
lola: sara is running 25 secs || 3138611 markings, 22142988 edges, 108335 markings/sec, 25 secs
lola: sara is running 30 secs || 3649499 markings, 25707318 edges, 102178 markings/sec, 30 secs
lola: sara is running 35 secs || 4120991 markings, 29363466 edges, 94298 markings/sec, 35 secs
lola: sara is running 40 secs || 4585622 markings, 33054474 edges, 92926 markings/sec, 40 secs
lola: sara is running 45 secs || 5035679 markings, 36782758 edges, 90011 markings/sec, 45 secs
lola: sara is running 50 secs || 5468200 markings, 40647971 edges, 86504 markings/sec, 50 secs
lola: sara is running 55 secs || 5865398 markings, 44633990 edges, 79440 markings/sec, 55 secs
lola: sara is running 60 secs || 6390072 markings, 48326012 edges, 104935 markings/sec, 60 secs
lola: sara is running 65 secs || 6884963 markings, 52133072 edges, 98978 markings/sec, 65 secs
lola: sara is running 70 secs || 7366492 markings, 55901077 edges, 96306 markings/sec, 70 secs
lola: sara is running 75 secs || 7865163 markings, 59381989 edges, 99734 markings/sec, 75 secs
lola: sara is running 80 secs || 8309789 markings, 63189123 edges, 88925 markings/sec, 80 secs
lola: sara is running 85 secs || 8743967 markings, 67055955 edges, 86836 markings/sec, 85 secs
lola: sara is running 90 secs || 9209751 markings, 70989014 edges, 93157 markings/sec, 90 secs
lola: sara is running 95 secs || 9672109 markings, 74979263 edges, 92472 markings/sec, 95 secs
lola: sara is running 100 secs || 10149950 markings, 78846756 edges, 95568 markings/sec, 100 secs
lola: sara is running 105 secs || 10557043 markings, 82543893 edges, 81419 markings/sec, 105 secs
lola: sara is running 110 secs || 11035407 markings, 86418254 edges, 95673 markings/sec, 110 secs
lola: sara is running 115 secs || 11476031 markings, 90502743 edges, 88125 markings/sec, 115 secs
lola: sara is running 120 secs || 11928266 markings, 94546659 edges, 90447 markings/sec, 120 secs
lola: sara is running 125 secs || 12365905 markings, 98514971 edges, 87528 markings/sec, 125 secs
lola: sara is running 130 secs || 12836001 markings, 102147979 edges, 94019 markings/sec, 130 secs
lola: sara is running 135 secs || 13337106 markings, 105837356 edges, 100221 markings/sec, 135 secs
lola: sara is running 140 secs || 13817441 markings, 109660405 edges, 96067 markings/sec, 140 secs
lola: sara is running 145 secs || 14320259 markings, 113362361 edges, 100564 markings/sec, 145 secs
lola: sara is running 150 secs || 14808150 markings, 116883081 edges, 97578 markings/sec, 150 secs
lola: sara is running 155 secs || 15249704 markings, 120618878 edges, 88311 markings/sec, 155 secs
lola: sara is running 160 secs || 15678015 markings, 124344893 edges, 85662 markings/sec, 160 secs
lola: sara is running 165 secs || 16180969 markings, 127929906 edges, 100591 markings/sec, 165 secs
lola: sara is running 170 secs || 16658730 markings, 131428382 edges, 95552 markings/sec, 170 secs
lola: sara is running 175 secs || 17118600 markings, 135215973 edges, 91974 markings/sec, 175 secs
lola: sara is running 180 secs || 17559443 markings, 138864737 edges, 88169 markings/sec, 180 secs
lola: sara is running 185 secs || 17977229 markings, 142709510 edges, 83557 markings/sec, 185 secs
lola: sara is running 190 secs || 18393354 markings, 146488951 edges, 83225 markings/sec, 190 secs
lola: sara is running 195 secs || 18794866 markings, 150204036 edges, 80302 markings/sec, 195 secs
lola: sara is running 200 secs || 19208393 markings, 154184489 edges, 82705 markings/sec, 200 secs
lola: sara is running 205 secs || 19666991 markings, 157985611 edges, 91720 markings/sec, 205 secs
lola: sara is running 210 secs || 20151203 markings, 161522867 edges, 96842 markings/sec, 210 secs
lola: sara is running 215 secs || 20577737 markings, 165276023 edges, 85307 markings/sec, 215 secs
lola: sara is running 220 secs || 20980300 markings, 169118887 edges, 80513 markings/sec, 220 secs
lola: sara is running 225 secs || 21442657 markings, 172530461 edges, 92471 markings/sec, 225 secs
lola: sara is running 230 secs || 21868294 markings, 176193872 edges, 85127 markings/sec, 230 secs
lola: sara is running 235 secs || 22256890 markings, 179751363 edges, 77719 markings/sec, 235 secs
lola: sara is running 240 secs || 22676623 markings, 183574598 edges, 83947 markings/sec, 240 secs
lola: sara is running 245 secs || 23136341 markings, 186905461 edges, 91944 markings/sec, 245 secs
lola: sara is running 250 secs || 23557606 markings, 190562364 edges, 84253 markings/sec, 250 secs
lola: sara is running 255 secs || 23988901 markings, 194060770 edges, 86259 markings/sec, 255 secs
lola: sara is running 260 secs || 24425975 markings, 197627753 edges, 87415 markings/sec, 260 secs
lola: sara is running 265 secs || 24886844 markings, 201237735 edges, 92174 markings/sec, 265 secs
lola: sara is running 270 secs || 25304592 markings, 204973670 edges, 83550 markings/sec, 270 secs
lola: sara is running 275 secs || 25695081 markings, 208668134 edges, 78098 markings/sec, 275 secs
lola: sara is running 280 secs || 26082461 markings, 212464882 edges, 77476 markings/sec, 280 secs
lola: sara is running 285 secs || 26453394 markings, 216180801 edges, 74187 markings/sec, 285 secs
lola: sara is running 290 secs || 26835289 markings, 219896860 edges, 76379 markings/sec, 290 secs
lola: sara is running 295 secs || 27235386 markings, 223690844 edges, 80019 markings/sec, 295 secs
lola: sara is running 300 secs || 27595862 markings, 227546976 edges, 72095 markings/sec, 300 secs
lola: sara is running 305 secs || 27952752 markings, 231441726 edges, 71378 markings/sec, 305 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 28209759 markings, 234577951 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no no yes no no no no no no no yes no
lola:
preliminary result: yes yes no no no no yes no no no no no no no yes no
lola: memory consumption: 38760 KB
lola: time consumption: 2502 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

BK_STOP 1552477528499

--------------------
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="DNAwalker-PT-11ringRR"
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 DNAwalker-PT-11ringRR, 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 r049-oct2-155234405500692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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