About the Execution of LoLA for DNAwalker-PT-10ringRL
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4285.860 | 1488264.00 | 1536251.00 | 112.30 | FTFTFTFFFFFFTTFF | normal |
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-155234405500683.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-10ringRL, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r049-oct2-155234405500683
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.5K Feb 10 20:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 10 20:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 6 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 15:42 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.3K Feb 4 23:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.7K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 3 06:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 18K 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-10ringRL-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-10ringRL-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552474666960
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-10ringRL @ 3570 seconds
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DNAwalker-PT-10ringRL-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2081
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-10ringRL
{
"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 10:57:47 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 197
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 3
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 210
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((A10 <= 2)))",
"processed_size": 18,
"rewrites": 5
},
"result":
{
"edges": 122663402,
"markings": 21210525,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 214
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= B13)))",
"processed_size": 18,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 230
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= A5)))",
"processed_size": 17,
"rewrites": 4
},
"result":
{
"edges": 77180643,
"markings": 14515096,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 241
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((3 <= A6)))",
"processed_size": 17,
"rewrites": 4
},
"result":
{
"edges": 120668066,
"markings": 21130818,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((2 <= B13)))",
"processed_size": 18,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((2 <= A5) AND (2 <= B15))))",
"processed_size": 34,
"rewrites": 4
},
"result":
{
"edges": 69467720,
"markings": 9807507,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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 (((A5 <= 1) OR (A12 <= 1))))",
"processed_size": 34,
"rewrites": 5
},
"result":
{
"edges": 58559319,
"markings": 11048086,
"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": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((B14 <= 2) OR (A3 <= B15) OR (1 <= A13))))",
"processed_size": 51,
"rewrites": 5
},
"result":
{
"edges": 69992925,
"markings": 16937125,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 358
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((A2 <= 0) AND (A20 + 1 <= A7) AND (3 <= A12))))",
"processed_size": 54,
"rewrites": 4
},
"result":
{
"edges": 200467288,
"markings": 27823562,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((2 <= A21) AND (3 <= B5) AND ((1 <= A6) OR (A4 <= A15)) AND (A15 <= 2) AND (A4 <= 0))))",
"processed_size": 95,
"rewrites": 4
},
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 453
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((A7 + 1 <= A5) AND (A20 + 1 <= A4) AND (1 <= B14))))",
"processed_size": 59,
"rewrites": 4
},
"result":
{
"edges": 7047593,
"markings": 2874909,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 11,
"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": 564
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (((A14 <= A7) OR (A11 <= A4) OR (A1 <= B15))))",
"processed_size": 53,
"rewrites": 5
},
"result":
{
"edges": 7508,
"markings": 4295,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 753
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((A8 <= A9) AND (1 <= B14) AND (2 <= B13) AND (A3 <= A18))))",
"processed_size": 66,
"rewrites": 4
},
"result":
{
"edges": 0,
"markings": 1,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1129
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F (((A17 + 1 <= B12) AND (A3 + 1 <= A5) AND ((A21 <= 2) OR (A2 + 1 <= A20)))))",
"processed_size": 82,
"rewrites": 4
},
"result":
{
"edges": 124426392,
"markings": 22846206,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2106
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((B12 + 1 <= A10) OR (A13 + 1 <= B5) OR (B13 <= B12) OR (2 <= A7) OR (A20 <= A5))))",
"processed_size": 93,
"rewrites": 5
},
"result":
{
"edges": 4,
"markings": 5,
"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": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 31560,
"runtime": 1464.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : FALSE : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 760,
"conflict_clusters": 7,
"places": 27,
"places_significant": 27,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "no yes no yes no yes no no no no no no yes yes no no ",
"value": "no yes no yes no yes no no no no no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: E (F ((2 <= B13))) : A (G ((A10 <= 2))) : E (F ((2 <= B13))) : E (F (((A7 + 1 <= A5) AND (A20 + 1 <= A4) AND (1 <= B14)))) : E (F ((3 <= A5))) : A (G (((A14 <= A7) OR (A11 <= A4) OR (A1 <= B15)))) : E (F (((2 <= A5) AND (2 <= B15)))) : E (F (((2 <= A21) AND (3 <= B5) AND ((1 <= A6) OR (A4 <= A15)) AND (A15 <= 2) AND (A4 <= 0)))) : E (F (((A17 + 1 <= B12) AND (A3 + 1 <= A5) AND ((A21 <= 2) OR (A2 + 1 <= A20))))) : E (F ((3 <= A6))) : E (F (((A2 <= 0) AND (A20 + 1 <= A7) AND (3 <= A12)))) : E (F (())) : A (G (((B14 <= 2) OR (A3 <= B15) OR (1 <= A13)))) : A (G (((A5 <= 1) OR (A12 <= 1)))) : E (F (((A8 <= A9) AND (1 <= B14) AND (2 <= B13) AND (A3 <= A18)))) : A (G (((B12 + 1 <= A10) OR (A13 + 1 <= B5) OR (B13 <= B12) OR (2 <= A7) OR (A20 <= A5))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A10 <= 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 ((A10 <= 2)))
lola: processed formula length: 18
lola: 5 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 <= A10)
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: :457: 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 || 808385 markings, 3406930 edges, 161677 markings/sec, 0 secs
lola: sara is running 5 secs || 1661649 markings, 6823019 edges, 170653 markings/sec, 5 secs
lola: sara is running 10 secs || 2390201 markings, 10545369 edges, 145710 markings/sec, 10 secs
lola: sara is running 15 secs || 3100250 markings, 14247003 edges, 142010 markings/sec, 15 secs
lola: sara is running 20 secs || 3875066 markings, 17800945 edges, 154963 markings/sec, 20 secs
lola: sara is running 25 secs || 4592288 markings, 21507575 edges, 143444 markings/sec, 25 secs
lola: sara is running 30 secs || 5323825 markings, 25296688 edges, 146307 markings/sec, 30 secs
lola: sara is running 35 secs || 5958684 markings, 29324985 edges, 126972 markings/sec, 35 secs
lola: sara is running 40 secs || 6598995 markings, 33361414 edges, 128062 markings/sec, 40 secs
lola: sara is running 45 secs || 7332257 markings, 37240560 edges, 146652 markings/sec, 45 secs
lola: sara is running 50 secs || 8082980 markings, 41178897 edges, 150145 markings/sec, 50 secs
lola: sara is running 55 secs || 8768006 markings, 45290801 edges, 137005 markings/sec, 55 secs
lola: sara is running 60 secs || 9494980 markings, 49276679 edges, 145395 markings/sec, 60 secs
lola: sara is running 65 secs || 10167078 markings, 53404872 edges, 134420 markings/sec, 65 secs
lola: sara is running 70 secs || 10830365 markings, 57462594 edges, 132657 markings/sec, 70 secs
lola: sara is running 75 secs || 11663600 markings, 61527275 edges, 166647 markings/sec, 75 secs
lola: sara is running 80 secs || 12436752 markings, 65749622 edges, 154630 markings/sec, 80 secs
lola: sara is running 85 secs || 13023515 markings, 69956312 edges, 117353 markings/sec, 85 secs
lola: sara is running 90 secs || 13626467 markings, 74238848 edges, 120590 markings/sec, 90 secs
lola: sara is running 95 secs || 14209151 markings, 78525078 edges, 116537 markings/sec, 95 secs
lola: sara is running 100 secs || 14995833 markings, 82481370 edges, 157336 markings/sec, 100 secs
lola: sara is running 105 secs || 15620937 markings, 86121166 edges, 125021 markings/sec, 105 secs
lola: sara is running 110 secs || 16285380 markings, 89849283 edges, 132889 markings/sec, 110 secs
lola: sara is running 115 secs || 16887045 markings, 93844405 edges, 120333 markings/sec, 115 secs
lola: sara is running 120 secs || 17486335 markings, 97816663 edges, 119858 markings/sec, 120 secs
lola: sara is running 125 secs || 18109879 markings, 101751516 edges, 124709 markings/sec, 125 secs
lola: sara is running 130 secs || 18743634 markings, 105722267 edges, 126751 markings/sec, 130 secs
lola: sara is running 135 secs || 19455336 markings, 109843630 edges, 142340 markings/sec, 135 secs
lola: sara is running 140 secs || 19994633 markings, 114005532 edges, 107859 markings/sec, 140 secs
lola: sara is running 145 secs || 20546374 markings, 118127464 edges, 110348 markings/sec, 145 secs
lola: sara is running 150 secs || 21148581 markings, 122245134 edges, 120441 markings/sec, 150 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 21210525 markings, 122663402 edges
lola: ========================================
lola: subprocess 2 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= B13)))
lola: processed formula length: 18
lola: 4 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 <= B13)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= A5)))
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 <= A5)))
lola: processed formula length: 17
lola: 4 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 <= A5)
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
sara: error: :457: 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 || 839714 markings, 3525532 edges, 167943 markings/sec, 0 secs
lola: sara is running 5 secs || 1640133 markings, 7208460 edges, 160084 markings/sec, 5 secs
lola: sara is running 10 secs || 2313989 markings, 10944423 edges, 134771 markings/sec, 10 secs
lola: sara is running 15 secs || 3151605 markings, 14779061 edges, 167523 markings/sec, 15 secs
lola: sara is running 20 secs || 3838260 markings, 18731444 edges, 137331 markings/sec, 20 secs
lola: sara is running 25 secs || 4573892 markings, 22787848 edges, 147126 markings/sec, 25 secs
lola: sara is running 30 secs || 5336541 markings, 26767768 edges, 152530 markings/sec, 30 secs
lola: sara is running 35 secs || 5994612 markings, 30929055 edges, 131614 markings/sec, 35 secs
lola: sara is running 40 secs || 6730865 markings, 34863269 edges, 147251 markings/sec, 40 secs
lola: sara is running 45 secs || 7521396 markings, 38652081 edges, 158106 markings/sec, 45 secs
lola: sara is running 50 secs || 8281789 markings, 42352145 edges, 152079 markings/sec, 50 secs
lola: sara is running 55 secs || 8965542 markings, 46399692 edges, 136751 markings/sec, 55 secs
lola: sara is running 60 secs || 9674993 markings, 50430408 edges, 141890 markings/sec, 60 secs
lola: sara is running 65 secs || 10426538 markings, 54327414 edges, 150309 markings/sec, 65 secs
lola: sara is running 70 secs || 11144325 markings, 58253563 edges, 143557 markings/sec, 70 secs
lola: sara is running 75 secs || 11835408 markings, 62174721 edges, 138217 markings/sec, 75 secs
lola: sara is running 80 secs || 12413084 markings, 66381266 edges, 115535 markings/sec, 80 secs
lola: sara is running 85 secs || 13032651 markings, 70436214 edges, 123913 markings/sec, 85 secs
lola: sara is running 90 secs || 13959779 markings, 74476776 edges, 185426 markings/sec, 90 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 14515096 markings, 77180643 edges
lola: ========================================
lola: subprocess 4 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 ((3 <= A6)))
lola: processed formula length: 17
lola: 4 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 <= A6)
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
sara: error: :457: 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 || 783588 markings, 3564653 edges, 156718 markings/sec, 0 secs
lola: sara is running 5 secs || 1567731 markings, 7508172 edges, 156829 markings/sec, 5 secs
lola: sara is running 10 secs || 2310631 markings, 11707938 edges, 148580 markings/sec, 10 secs
lola: sara is running 15 secs || 3031490 markings, 15809795 edges, 144172 markings/sec, 15 secs
lola: sara is running 20 secs || 3792234 markings, 20005005 edges, 152149 markings/sec, 20 secs
lola: sara is running 25 secs || 4503129 markings, 23930166 edges, 142179 markings/sec, 25 secs
lola: sara is running 30 secs || 5231581 markings, 27923375 edges, 145690 markings/sec, 30 secs
lola: sara is running 35 secs || 5963552 markings, 31926116 edges, 146394 markings/sec, 35 secs
lola: sara is running 40 secs || 6709591 markings, 35842964 edges, 149208 markings/sec, 40 secs
lola: sara is running 45 secs || 7467298 markings, 39902032 edges, 151541 markings/sec, 45 secs
lola: sara is running 50 secs || 8170601 markings, 44038961 edges, 140661 markings/sec, 50 secs
lola: sara is running 55 secs || 8745666 markings, 48372339 edges, 115013 markings/sec, 55 secs
lola: sara is running 60 secs || 9421270 markings, 52242443 edges, 135121 markings/sec, 60 secs
lola: sara is running 65 secs || 10119455 markings, 56021290 edges, 139637 markings/sec, 65 secs
lola: sara is running 70 secs || 10875931 markings, 59926050 edges, 151295 markings/sec, 70 secs
lola: sara is running 75 secs || 11578245 markings, 64053781 edges, 140463 markings/sec, 75 secs
lola: sara is running 80 secs || 12244931 markings, 68183417 edges, 133337 markings/sec, 80 secs
lola: sara is running 85 secs || 12960938 markings, 72245275 edges, 143201 markings/sec, 85 secs
lola: sara is running 90 secs || 13653151 markings, 76374895 edges, 138443 markings/sec, 90 secs
lola: sara is running 95 secs || 14337588 markings, 80121153 edges, 136887 markings/sec, 95 secs
lola: sara is running 100 secs || 15004276 markings, 84130479 edges, 133338 markings/sec, 100 secs
lola: sara is running 105 secs || 15609773 markings, 88188022 edges, 121099 markings/sec, 105 secs
lola: sara is running 110 secs || 16222587 markings, 92242803 edges, 122563 markings/sec, 110 secs
lola: sara is running 115 secs || 16799372 markings, 96406864 edges, 115357 markings/sec, 115 secs
lola: sara is running 120 secs || 17499261 markings, 100581109 edges, 139978 markings/sec, 120 secs
lola: sara is running 125 secs || 18166788 markings, 104711704 edges, 133505 markings/sec, 125 secs
lola: sara is running 130 secs || 18868640 markings, 108963181 edges, 140370 markings/sec, 130 secs
lola: sara is running 135 secs || 19802206 markings, 113124219 edges, 186713 markings/sec, 135 secs
lola: sara is running 140 secs || 20539863 markings, 117429182 edges, 147531 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 21130818 markings, 120668066 edges
lola: ========================================
lola: subprocess 5 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= 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 ((2 <= B13)))
lola: processed formula length: 18
lola: 4 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 <= B13)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= A5) AND (2 <= B15))))
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 <= A5) AND (2 <= B15))))
lola: processed formula length: 34
lola: 4 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 <= A5) AND (2 <= B15))
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-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-6-0.sara.
sara: error: :457: 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 || 684618 markings, 3570252 edges, 136924 markings/sec, 0 secs
lola: sara is running 5 secs || 1313882 markings, 7297640 edges, 125853 markings/sec, 5 secs
lola: sara is running 10 secs || 1902662 markings, 11176036 edges, 117756 markings/sec, 10 secs
lola: sara is running 15 secs || 2510528 markings, 15271474 edges, 121573 markings/sec, 15 secs
lola: sara is running 20 secs || 3091747 markings, 19542864 edges, 116244 markings/sec, 20 secs
lola: sara is running 25 secs || 3663269 markings, 23803344 edges, 114304 markings/sec, 25 secs
lola: sara is running 30 secs || 4197136 markings, 28055911 edges, 106773 markings/sec, 30 secs
lola: sara is running 35 secs || 4802359 markings, 32089986 edges, 121045 markings/sec, 35 secs
lola: sara is running 40 secs || 5394305 markings, 35998299 edges, 118389 markings/sec, 40 secs
lola: sara is running 45 secs || 5980481 markings, 39936364 edges, 117235 markings/sec, 45 secs
lola: sara is running 50 secs || 6520660 markings, 44161173 edges, 108036 markings/sec, 50 secs
lola: sara is running 55 secs || 7087336 markings, 48251382 edges, 113335 markings/sec, 55 secs
lola: sara is running 60 secs || 7637043 markings, 52328255 edges, 109941 markings/sec, 60 secs
lola: sara is running 65 secs || 8168615 markings, 56396910 edges, 106314 markings/sec, 65 secs
lola: sara is running 70 secs || 8687563 markings, 60677847 edges, 103790 markings/sec, 70 secs
lola: sara is running 75 secs || 9204300 markings, 64879646 edges, 103347 markings/sec, 75 secs
lola: sara is running 80 secs || 9772652 markings, 69197421 edges, 113670 markings/sec, 80 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 9807507 markings, 69467720 edges
lola: ========================================
lola: subprocess 7 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A5 <= 1) OR (A12 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((A5 <= 1) OR (A12 <= 1))))
lola: processed formula length: 34
lola: 5 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 <= A5) AND (2 <= A12))
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-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-7-0.sara.
sara: error: :457: 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 || 815723 markings, 3525138 edges, 163145 markings/sec, 0 secs
lola: sara is running 5 secs || 1681759 markings, 7138996 edges, 173207 markings/sec, 5 secs
lola: sara is running 10 secs || 2548538 markings, 10921609 edges, 173356 markings/sec, 10 secs
lola: sara is running 15 secs || 3445967 markings, 14701396 edges, 179486 markings/sec, 15 secs
lola: sara is running 20 secs || 4096227 markings, 18871423 edges, 130052 markings/sec, 20 secs
lola: sara is running 25 secs || 4650660 markings, 23093088 edges, 110887 markings/sec, 25 secs
lola: sara is running 30 secs || 5452933 markings, 26835580 edges, 160455 markings/sec, 30 secs
lola: sara is running 35 secs || 6264325 markings, 30521772 edges, 162278 markings/sec, 35 secs
lola: sara is running 40 secs || 6923281 markings, 34625338 edges, 131791 markings/sec, 40 secs
lola: sara is running 45 secs || 7549820 markings, 38606389 edges, 125308 markings/sec, 45 secs
lola: sara is running 50 secs || 8299892 markings, 42489206 edges, 150014 markings/sec, 50 secs
lola: sara is running 55 secs || 8894038 markings, 46506001 edges, 118829 markings/sec, 55 secs
lola: sara is running 60 secs || 9684908 markings, 50338642 edges, 158174 markings/sec, 60 secs
lola: sara is running 65 secs || 10488393 markings, 54355162 edges, 160697 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 11048086 markings, 58559319 edges
lola: ========================================
lola: subprocess 8 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((B14 <= 2) OR (A3 <= B15) OR (1 <= A13))))
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 (((B14 <= 2) OR (A3 <= B15) OR (1 <= A13))))
lola: processed formula length: 51
lola: 5 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 <= B14) AND (B15 + 1 <= A3) AND (A13 <= 0))
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-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-8-0.sara.
sara: error: :457: 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 || 1181724 markings, 3816309 edges, 236345 markings/sec, 0 secs
lola: sara is running 5 secs || 2218265 markings, 7795104 edges, 207308 markings/sec, 5 secs
lola: sara is running 10 secs || 3329453 markings, 11809937 edges, 222238 markings/sec, 10 secs
lola: sara is running 15 secs || 4381190 markings, 15870353 edges, 210347 markings/sec, 15 secs
lola: sara is running 20 secs || 5324832 markings, 20023460 edges, 188728 markings/sec, 20 secs
lola: sara is running 25 secs || 6292963 markings, 24357419 edges, 193626 markings/sec, 25 secs
lola: sara is running 30 secs || 7265277 markings, 28654066 edges, 194463 markings/sec, 30 secs
lola: sara is running 35 secs || 8342545 markings, 32564325 edges, 215454 markings/sec, 35 secs
lola: sara is running 40 secs || 9358108 markings, 36710580 edges, 203113 markings/sec, 40 secs
lola: sara is running 45 secs || 10373304 markings, 40850847 edges, 203039 markings/sec, 45 secs
lola: sara is running 50 secs || 11419419 markings, 44982324 edges, 209223 markings/sec, 50 secs
lola: sara is running 55 secs || 12328650 markings, 49151664 edges, 181846 markings/sec, 55 secs
lola: sara is running 60 secs || 13168977 markings, 53433420 edges, 168065 markings/sec, 60 secs
lola: sara is running 65 secs || 14032771 markings, 57560515 edges, 172759 markings/sec, 65 secs
lola: sara is running 70 secs || 15115160 markings, 61576638 edges, 216478 markings/sec, 70 secs
lola: sara is running 75 secs || 15951528 markings, 65834451 edges, 167274 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 16937125 markings, 69992925 edges
lola: ========================================
lola: subprocess 9 will run for 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A2 <= 0) AND (A20 + 1 <= A7) AND (3 <= A12))))
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 (((A2 <= 0) AND (A20 + 1 <= A7) AND (3 <= A12))))
lola: processed formula length: 54
lola: 4 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: ((A2 <= 0) AND (A20 + 1 <= A7) AND (3 <= A12))
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-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-9-0.sara.
sara: error: :457: 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 || 775080 markings, 3529754 edges, 155016 markings/sec, 0 secs
lola: sara is running 5 secs || 1468128 markings, 7240465 edges, 138610 markings/sec, 5 secs
lola: sara is running 10 secs || 2191549 markings, 11260453 edges, 144684 markings/sec, 10 secs
lola: sara is running 15 secs || 2924751 markings, 14981263 edges, 146640 markings/sec, 15 secs
lola: sara is running 20 secs || 3603669 markings, 18969881 edges, 135784 markings/sec, 20 secs
lola: sara is running 25 secs || 4280850 markings, 22881789 edges, 135436 markings/sec, 25 secs
lola: sara is running 30 secs || 4952785 markings, 26610988 edges, 134387 markings/sec, 30 secs
lola: sara is running 35 secs || 5696756 markings, 30505320 edges, 148794 markings/sec, 35 secs
lola: sara is running 40 secs || 6406686 markings, 34396088 edges, 141986 markings/sec, 40 secs
lola: sara is running 45 secs || 7038164 markings, 38368862 edges, 126296 markings/sec, 45 secs
lola: sara is running 50 secs || 7787065 markings, 42299344 edges, 149780 markings/sec, 50 secs
lola: sara is running 55 secs || 8382502 markings, 46092922 edges, 119087 markings/sec, 55 secs
lola: sara is running 60 secs || 9067231 markings, 50125629 edges, 136946 markings/sec, 60 secs
lola: sara is running 65 secs || 9707335 markings, 54259036 edges, 128021 markings/sec, 65 secs
lola: sara is running 70 secs || 10388490 markings, 58482873 edges, 136231 markings/sec, 70 secs
lola: sara is running 75 secs || 11000571 markings, 62721007 edges, 122416 markings/sec, 75 secs
lola: sara is running 80 secs || 11619878 markings, 66974422 edges, 123861 markings/sec, 80 secs
lola: sara is running 85 secs || 12199698 markings, 71204441 edges, 115964 markings/sec, 85 secs
lola: sara is running 90 secs || 12780136 markings, 75489233 edges, 116088 markings/sec, 90 secs
lola: sara is running 95 secs || 13383406 markings, 79908612 edges, 120654 markings/sec, 95 secs
lola: sara is running 100 secs || 13885230 markings, 83931868 edges, 100365 markings/sec, 100 secs
lola: sara is running 105 secs || 14391650 markings, 88293323 edges, 101284 markings/sec, 105 secs
lola: sara is running 110 secs || 14928838 markings, 92645783 edges, 107438 markings/sec, 110 secs
lola: sara is running 115 secs || 15449551 markings, 96995740 edges, 104143 markings/sec, 115 secs
lola: sara is running 120 secs || 15985283 markings, 101281451 edges, 107146 markings/sec, 120 secs
lola: sara is running 125 secs || 16531411 markings, 105536087 edges, 109226 markings/sec, 125 secs
lola: sara is running 130 secs || 17016911 markings, 109854000 edges, 97100 markings/sec, 130 secs
lola: sara is running 135 secs || 17529380 markings, 114296952 edges, 102494 markings/sec, 135 secs
lola: sara is running 140 secs || 18065361 markings, 118572736 edges, 107196 markings/sec, 140 secs
lola: sara is running 145 secs || 18691957 markings, 122866292 edges, 125319 markings/sec, 145 secs
lola: sara is running 150 secs || 19193617 markings, 126772923 edges, 100332 markings/sec, 150 secs
lola: sara is running 155 secs || 19697872 markings, 131016690 edges, 100851 markings/sec, 155 secs
lola: sara is running 160 secs || 20225877 markings, 135311616 edges, 105601 markings/sec, 160 secs
lola: sara is running 165 secs || 20736570 markings, 139523997 edges, 102139 markings/sec, 165 secs
lola: sara is running 170 secs || 21234223 markings, 143811258 edges, 99531 markings/sec, 170 secs
lola: sara is running 175 secs || 21748001 markings, 148237386 edges, 102756 markings/sec, 175 secs
lola: sara is running 180 secs || 22274741 markings, 152496536 edges, 105348 markings/sec, 180 secs
lola: sara is running 185 secs || 22805737 markings, 156772512 edges, 106199 markings/sec, 185 secs
lola: sara is running 190 secs || 23327493 markings, 161090696 edges, 104351 markings/sec, 190 secs
lola: sara is running 195 secs || 23885389 markings, 165383173 edges, 111579 markings/sec, 195 secs
lola: sara is running 200 secs || 24434603 markings, 169737931 edges, 109843 markings/sec, 200 secs
lola: sara is running 205 secs || 24979115 markings, 174212231 edges, 108902 markings/sec, 205 secs
lola: sara is running 210 secs || 25480149 markings, 178427239 edges, 100207 markings/sec, 210 secs
lola: sara is running 215 secs || 25916867 markings, 182621906 edges, 87344 markings/sec, 215 secs
lola: sara is running 220 secs || 26381357 markings, 186945514 edges, 92898 markings/sec, 220 secs
lola: sara is running 225 secs || 26861840 markings, 191350744 edges, 96097 markings/sec, 225 secs
lola: sara is running 230 secs || 27333538 markings, 195591900 edges, 94340 markings/sec, 230 secs
lola: sara is running 235 secs || 27768476 markings, 199835720 edges, 86988 markings/sec, 235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 27823562 markings, 200467288 edges
lola: ========================================
lola: subprocess 10 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= A21) AND (3 <= B5) AND ((1 <= A6) OR (A4 <= A15)) AND (A15 <= 2) AND (A4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= A21) AND (3 <= B5) AND ((1 <= A6) OR (A4 <= A15)) AND (A15 <= 2) AND (A4 <= 0))))
lola: processed formula length: 95
lola: 4 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: state equation task get result unparse finished++ id 0
lola: formula 0: ((2 <= A21) AND (3 <= B5) AND ((1 <= A6) OR (A4 <= A15)) AND (A15 <= 2) AND (A4 <= 0))
lola: ========================================
lola: subprocess 11 will run for 453 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A7 + 1 <= A5) AND (A20 + 1 <= A4) AND (1 <= B14))))
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 (((A7 + 1 <= A5) AND (A20 + 1 <= A4) AND (1 <= B14))))
lola: processed formula length: 59
lola: 4 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: ((A7 + 1 <= A5) AND (A20 + 1 <= A4) AND (1 <= B14))
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-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-11-0.sara.
sara: error: :457: 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 || 1601124 markings, 3741283 edges, 320225 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2874909 markings, 7047593 edges
lola: ========================================
lola: subprocess 12 will run for 564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((A14 <= A7) OR (A11 <= A4) OR (A1 <= B15))))
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 <= A7) OR (A11 <= A4) OR (A1 <= B15))))
lola: processed formula length: 53
lola: 5 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: ((A7 + 1 <= A14) AND (A4 + 1 <= A11) AND (B15 + 1 <= A1))
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-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-12-0.sara.
sara: error: :457: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4295 markings, 7508 edges
lola: ========================================
lola: subprocess 13 will run for 753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A8 <= A9) AND (1 <= B14) AND (2 <= B13) AND (A3 <= A18))))
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 (((A8 <= A9) AND (1 <= B14) AND (2 <= B13) AND (A3 <= A18))))
lola: processed formula length: 66
lola: 4 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 14 will run for 1129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((A17 + 1 <= B12) AND (A3 + 1 <= A5) AND ((A21 <= 2) OR (A2 + 1 <= A20)))))
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 (((A17 + 1 <= B12) AND (A3 + 1 <= A5) AND ((A21 <= 2) OR (A2 + 1 <= A20)))))
lola: processed formula length: 82
lola: 4 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: ((A17 + 1 <= B12) AND (A3 + 1 <= A5) AND ((A21 <= 2) OR (A2 + 1 <= A20)))
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-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-14-0.sara.
sara: error: :457: 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 || 1043953 markings, 3650970 edges, 208791 markings/sec, 0 secs
lola: sara is running 5 secs || 1944392 markings, 7622549 edges, 180088 markings/sec, 5 secs
lola: sara is running 10 secs || 2832475 markings, 11702984 edges, 177617 markings/sec, 10 secs
lola: sara is running 15 secs || 3727003 markings, 15941136 edges, 178906 markings/sec, 15 secs
lola: sara is running 20 secs || 4691930 markings, 19940973 edges, 192985 markings/sec, 20 secs
lola: sara is running 25 secs || 5594984 markings, 24078023 edges, 180611 markings/sec, 25 secs
lola: sara is running 30 secs || 6535140 markings, 28142174 edges, 188031 markings/sec, 30 secs
lola: sara is running 35 secs || 7213277 markings, 32316472 edges, 135627 markings/sec, 35 secs
lola: sara is running 40 secs || 8125502 markings, 36462254 edges, 182445 markings/sec, 40 secs
lola: sara is running 45 secs || 8942552 markings, 39857116 edges, 163410 markings/sec, 45 secs
lola: sara is running 50 secs || 9824029 markings, 43443486 edges, 176295 markings/sec, 50 secs
lola: sara is running 55 secs || 10585919 markings, 47202219 edges, 152378 markings/sec, 55 secs
lola: sara is running 60 secs || 11431033 markings, 50795090 edges, 169023 markings/sec, 60 secs
lola: sara is running 65 secs || 12175709 markings, 54548598 edges, 148935 markings/sec, 65 secs
lola: sara is running 70 secs || 12851218 markings, 58445092 edges, 135102 markings/sec, 70 secs
lola: sara is running 75 secs || 13719601 markings, 62086302 edges, 173677 markings/sec, 75 secs
lola: sara is running 80 secs || 14369926 markings, 66020019 edges, 130065 markings/sec, 80 secs
lola: sara is running 85 secs || 14982285 markings, 70040958 edges, 122472 markings/sec, 85 secs
lola: sara is running 90 secs || 15682324 markings, 74124887 edges, 140008 markings/sec, 90 secs
lola: sara is running 95 secs || 16329080 markings, 78228591 edges, 129351 markings/sec, 95 secs
lola: sara is running 100 secs || 17054874 markings, 82533930 edges, 145159 markings/sec, 100 secs
lola: sara is running 105 secs || 17672921 markings, 86939877 edges, 123609 markings/sec, 105 secs
lola: sara is running 110 secs || 18362288 markings, 91203090 edges, 137873 markings/sec, 110 secs
lola: sara is running 115 secs || 19014987 markings, 95496247 edges, 130540 markings/sec, 115 secs
lola: sara is running 120 secs || 19612711 markings, 99994215 edges, 119545 markings/sec, 120 secs
lola: sara is running 125 secs || 20212375 markings, 104485887 edges, 119933 markings/sec, 125 secs
lola: sara is running 130 secs || 20948066 markings, 108900278 edges, 147138 markings/sec, 130 secs
lola: sara is running 135 secs || 21505016 markings, 113378736 edges, 111390 markings/sec, 135 secs
lola: sara is running 140 secs || 22060090 markings, 117806457 edges, 111015 markings/sec, 140 secs
lola: sara is running 145 secs || 22556274 markings, 122415066 edges, 99237 markings/sec, 145 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 22846206 markings, 124426392 edges
lola: ========================================
lola: subprocess 15 will run for 2106 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((B12 + 1 <= A10) OR (A13 + 1 <= B5) OR (B13 <= B12) OR (2 <= A7) OR (A20 <= A5))))
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 (((B12 + 1 <= A10) OR (A13 + 1 <= B5) OR (B13 <= B12) OR (2 <= A7) OR (A20 <= A5))))
lola: processed formula length: 93
lola: 5 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: ((A10 <= B12) AND (B5 <= A13) AND (B12 + 1 <= B13) AND (A7 <= 1) AND (A5 + 1 <= A20))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
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: :457: 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: RESULT
lola:
SUMMARY: no yes no yes no yes no no no no no no yes yes no no
lola: ========================================
lola:
preliminary result: no yes no yes no yes no no no no no no yes yes no no
lola: memory consumption: 31560 KB
lola: time consumption: 1464 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552476155224
--------------------
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-10ringRL"
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-10ringRL, 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-155234405500683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-10ringRL.tgz
mv DNAwalker-PT-10ringRL 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 '
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 ;