About the Execution of LoLA for Diffusion2D-PT-D50N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5034.580 | 1144123.00 | 1841623.00 | 338.80 | TTFFTTFTTFTFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r060-ebro-155234654900251.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is Diffusion2D-PT-D50N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-ebro-155234654900251
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 3.8K Feb 10 21:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 21:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Feb 6 17:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 6 17:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 23:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 3 07:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 3 07:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jan 30 23:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 30 23:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 Diffusion2D-PT-D50N100-ReachabilityCardinality-00
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-01
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-02
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-03
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-04
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-05
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-06
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-07
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-08
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-09
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D50N100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552599844870
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Diffusion2D-PT-D50N100 @ 3570 seconds
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Diffusion2D-PT-D50N100-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2426
rslt: Output for ReachabilityCardinality @ Diffusion2D-PT-D50N100
{
"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": "Thu Mar 14 21:44:04 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 193
},
"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 ((cAMP__50_46_ <= 2)))",
"processed_size": 27,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 202
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((cAMP__21_1_ <= cAMP__10_47_)))",
"processed_size": 37,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 213
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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": "E (F (((2 <= cAMP__33_39_) OR (3 <= cAMP__34_23_))))",
"processed_size": 53,
"rewrites": 1
},
"result":
{
"edges": 30326,
"markings": 8597,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 228
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cAMP__22_12_) AND (cAMP__21_1_ + 1 <= cAMP__25_44_))))",
"processed_size": 67,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 242
},
"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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((cAMP__2_20_ <= cAMP__7_32_) AND (cAMP__11_24_ + 1 <= cAMP__48_10_))))",
"processed_size": 77,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 260
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= cAMP__41_30_) AND (((1 <= cAMP__26_16_) AND (2 <= cAMP__27_48_)) OR (2 <= cAMP__30_42_)))))",
"processed_size": 105,
"rewrites": 1
},
"result":
{
"edges": 55984,
"markings": 16111,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((cAMP__43_47_ + 1 <= cAMP__22_27_) OR (cAMP__36_8_ <= 0) OR (cAMP__46_47_ <= 0) OR (cAMP__27_11_ <= 1))))",
"processed_size": 115,
"rewrites": 2
},
"result":
{
"edges": 73213,
"markings": 21367,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 310
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cAMP__14_36_) OR (1 <= cAMP__38_31_) OR (3 <= cAMP__27_11_) OR ((cAMP__38_23_ + 1 <= cAMP__28_38_) AND (cAMP__42_45_ <= 1)))))",
"processed_size": 142,
"rewrites": 1
},
"result":
{
"edges": 1093,
"markings": 297,
"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": 5,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((3 <= cAMP__20_7_) AND (2 <= cAMP__26_26_) AND (1 <= cAMP__41_37_) AND (1 <= cAMP__40_24_) AND (cAMP__48_36_ <= cAMP__1_29_))))",
"processed_size": 134,
"rewrites": 1
},
"result":
{
"edges": 93190,
"markings": 25935,
"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": 5,
"problems": 5
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 389
},
"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 (((3 <= cAMP__40_44_) AND (cAMP__37_4_ <= cAMP__21_18_) AND (cAMP__26_31_ <= cAMP__6_48_) AND (1 <= cAMP__13_6_))))",
"processed_size": 120,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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 (((cAMP__23_48_ + 1 <= cAMP__2_50_) AND (cAMP__35_15_ + 1 <= cAMP__6_40_) AND ((cAMP__4_39_ + 1 <= cAMP__19_23_) OR (cAMP__15_50_ <= 1)))))",
"processed_size": 145,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 522
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"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": "A (G (((cAMP__6_1_ <= cAMP__42_1_) OR (3 <= cAMP__20_33_) OR (cAMP__13_4_ + 1 <= cAMP__25_46_) OR (cAMP__49_38_ <= cAMP__16_45_))))",
"processed_size": 134,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 639
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "A (G (((cAMP__48_49_ <= cAMP__33_5_) OR ((cAMP__18_3_ <= cAMP__21_28_) AND ((3 <= cAMP__49_14_) OR (cAMP__5_22_ <= cAMP__14_46_))))))",
"processed_size": 135,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 833
},
"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": 8,
"visible_transitions": 0
},
"processed": "A (G (((2 <= cAMP__15_21_) OR (3 <= cAMP__45_29_) OR ((cAMP__15_30_ <= cAMP__41_31_) AND (cAMP__4_41_ <= cAMP__3_49_)) OR (cAMP__10_41_ <= cAMP__5_6_))))",
"processed_size": 156,
"rewrites": 2
},
"result":
{
"edges": 3589,
"markings": 1052,
"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": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1248
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "E (F (((3 <= cAMP__2_48_) AND (2 <= cAMP__26_18_) AND (cAMP__45_12_ + 1 <= cAMP__39_38_) AND (((cAMP__35_29_ <= cAMP__31_8_) AND (cAMP__16_25_ <= cAMP__18_20_)) OR (cAMP__7_32_ <= 1)))))",
"processed_size": 187,
"rewrites": 1
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 9,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2434
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((2 <= cAMP__36_47_) AND (cAMP__37_44_ <= cAMP__5_29_) AND (1 <= cAMP__13_19_) AND ((2 <= cAMP__29_20_) OR (cAMP__26_2_ <= cAMP__50_35_) OR (3 <= cAMP__13_31_) OR (cAMP__5_40_ <= cAMP__39_13_)))))",
"processed_size": 205,
"rewrites": 1
},
"result":
{
"edges": 17064,
"markings": 4712,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 786220,
"runtime": 1144.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 38808,
"conflict_clusters": 2500,
"places": 2500,
"places_significant": 2499,
"singleton_clusters": 0,
"transitions": 19404
},
"result":
{
"preliminary_value": "yes yes no no yes yes no yes yes no yes no yes yes yes no ",
"value": "yes yes no no yes yes no yes yes no yes no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 21904/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80000
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 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 (((3 <= cAMP__40_44_) AND (cAMP__37_4_ <= cAMP__21_18_) AND (cAMP__26_31_ <= cAMP__6_48_) AND (1 <= cAMP__13_6_)))) : E (F (((cAMP__2_20_ <= cAMP__7_32_) AND (cAMP__11_24_ + 1 <= cAMP__48_10_)))) : A (G (((cAMP__43_47_ + 1 <= cAMP__22_27_) OR (cAMP__36_8_ <= 0) OR (cAMP__46_47_ <= 0) OR (cAMP__27_11_ <= 1)))) : A (G (((cAMP__48_49_ <= cAMP__33_5_) OR ((cAMP__18_3_ <= cAMP__21_28_) AND ((3 <= cAMP__49_14_) OR (cAMP__5_22_ <= cAMP__14_46_)))))) : E (F (((2 <= cAMP__36_47_) AND (cAMP__37_44_ <= cAMP__5_29_) AND (1 <= cAMP__13_19_) AND ((2 <= cAMP__29_20_) OR (cAMP__26_2_ <= cAMP__50_35_) OR (3 <= cAMP__13_31_) OR (cAMP__5_40_ <= cAMP__39_13_))))) : E (F (((2 <= cAMP__33_39_) OR (3 <= cAMP__34_23_)))) : A (G ((cAMP__21_1_ <= cAMP__10_47_))) : E (F (((3 <= cAMP__2_48_) AND (2 <= cAMP__26_18_) AND (cAMP__45_12_ + 1 <= cAMP__39_38_) AND (((cAMP__35_29_ <= cAMP__31_8_) AND (cAMP__16_25_ <= cAMP__18_20_)) OR (cAMP__7_32_ <= 1))))) : E (F (((2 <= cAMP__14_36_) OR (1 <= cAMP__38_31_) OR (3 <= cAMP__27_11_) OR ((cAMP__38_23_ + 1 <= cAMP__28_38_) AND (cAMP__42_45_ <= 1))))) : A (G (((2 <= cAMP__15_21_) OR (3 <= cAMP__45_29_) OR ((cAMP__15_30_ <= cAMP__41_31_) AND (cAMP__4_41_ <= cAMP__3_49_)) OR (cAMP__10_41_ <= cAMP__5_6_)))) : E (F (((1 <= cAMP__41_30_) AND (((1 <= cAMP__26_16_) AND (2 <= cAMP__27_48_)) OR (2 <= cAMP__30_42_))))) : A (G (((cAMP__6_1_ <= cAMP__42_1_) OR (3 <= cAMP__20_33_) OR (cAMP__13_4_ + 1 <= cAMP__25_46_) OR (cAMP__49_38_ <= cAMP__16_45_)))) : E (F (((2 <= cAMP__22_12_) AND (cAMP__21_1_ + 1 <= cAMP__25_44_)))) : E (F (((cAMP__23_48_ + 1 <= cAMP__2_50_) AND (cAMP__35_15_ + 1 <= cAMP__6_40_) AND ((cAMP__4_39_ + 1 <= cAMP__19_23_) OR (cAMP__15_50_ <= 1))))) : E (F (((3 <= cAMP__20_7_) AND (2 <= cAMP__26_26_) AND (1 <= cAMP__41_37_) AND (1 <= cAMP__40_24_) AND (cAMP__48_36_ <= cAMP__1_29_)))) : A (G ((cAMP__50_46_ <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__50_46_ <= 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 ((cAMP__50_46_ <= 2)))
lola: processed formula length: 27
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 <= cAMP__50_46_)
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.
lola: sara is running 0 secs || 2814 markings, 10269 edges, 563 markings/sec, 0 secs
lola: sara is running 5 secs || 5669 markings, 20743 edges, 571 markings/sec, 5 secs
lola: sara is running 10 secs || 8573 markings, 31480 edges, 581 markings/sec, 10 secs
lola: sara is running 15 secs || 11476 markings, 42544 edges, 581 markings/sec, 15 secs
lola: sara is running 20 secs || 14359 markings, 53911 edges, 577 markings/sec, 20 secs
lola: sara is running 25 secs || 17255 markings, 64789 edges, 579 markings/sec, 25 secs
lola: sara is running 30 secs || 20150 markings, 75694 edges, 579 markings/sec, 30 secs
lola: sara is running 35 secs || 23048 markings, 86541 edges, 580 markings/sec, 35 secs
lola: sara is running 40 secs || 25925 markings, 97906 edges, 575 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 28798 markings, 109115 edges, 575 markings/sec, 45 secs
lola: sara is running 50 secs || 31685 markings, 119678 edges, 577 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 202 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__21_1_ <= cAMP__10_47_)))
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 ((cAMP__21_1_ <= cAMP__10_47_)))
lola: processed formula length: 37
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: (cAMP__10_47_ + 1 <= cAMP__21_1_)
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.
lola: sara is running 0 secs || 2977 markings, 10221 edges, 595 markings/sec, 0 secs
lola: sara is running 5 secs || 5975 markings, 20828 edges, 600 markings/sec, 5 secs
lola: sara is running 10 secs || 8973 markings, 31479 edges, 600 markings/sec, 10 secs
lola: sara is running 15 secs || 11955 markings, 42139 edges, 596 markings/sec, 15 secs
lola: sara is running 20 secs || 14950 markings, 52838 edges, 599 markings/sec, 20 secs
lola: sara is running 25 secs || 17938 markings, 63660 edges, 598 markings/sec, 25 secs
lola: sara is running 30 secs || 20910 markings, 74481 edges, 594 markings/sec, 30 secs
lola: sara is running 35 secs || 23830 markings, 84834 edges, 584 markings/sec, 35 secs
lola: sara is running 40 secs || 26817 markings, 95592 edges, 597 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 29838 markings, 104960 edges, 604 markings/sec, 45 secs
lola: sara is running 50 secs || 32823 markings, 115388 edges, 597 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__33_39_) OR (3 <= cAMP__34_23_))))
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 <= cAMP__33_39_) OR (3 <= cAMP__34_23_))))
lola: processed formula length: 53
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 <= cAMP__33_39_) OR (3 <= cAMP__34_23_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 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.
lola: sara is running 0 secs || 2895 markings, 10620 edges, 579 markings/sec, 0 secs
lola: sara is running 5 secs || 5830 markings, 21356 edges, 587 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8597 markings, 30326 edges
lola: ========================================
lola: subprocess 3 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__22_12_) AND (cAMP__21_1_ + 1 <= cAMP__25_44_))))
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 <= cAMP__22_12_) AND (cAMP__21_1_ + 1 <= cAMP__25_44_))))
lola: processed formula length: 67
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 <= cAMP__22_12_) AND (cAMP__21_1_ + 1 <= cAMP__25_44_))
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.
lola: sara is running 0 secs || 2936 markings, 10609 edges, 587 markings/sec, 0 secs
lola: sara is running 5 secs || 5907 markings, 20934 edges, 594 markings/sec, 5 secs
lola: sara is running 10 secs || 8872 markings, 31414 edges, 593 markings/sec, 10 secs
lola: sara is running 15 secs || 11834 markings, 41727 edges, 592 markings/sec, 15 secs
lola: sara is running 20 secs || 14793 markings, 52210 edges, 592 markings/sec, 20 secs
lola: sara is running 25 secs || 17756 markings, 62630 edges, 593 markings/sec, 25 secs
lola: sara is running 30 secs || 20709 markings, 73388 edges, 591 markings/sec, 30 secs
lola: sara is running 35 secs || 23659 markings, 84192 edges, 590 markings/sec, 35 secs
lola: sara is running 40 secs || 26608 markings, 94612 edges, 590 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 29565 markings, 104675 edges, 591 markings/sec, 45 secs
lola: sara is running 50 secs || 32511 markings, 114919 edges, 589 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 242 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__2_20_ <= cAMP__7_32_) AND (cAMP__11_24_ + 1 <= cAMP__48_10_))))
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 (((cAMP__2_20_ <= cAMP__7_32_) AND (cAMP__11_24_ + 1 <= cAMP__48_10_))))
lola: processed formula length: 77
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: ((cAMP__2_20_ <= cAMP__7_32_) AND (cAMP__11_24_ + 1 <= cAMP__48_10_))
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-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
lola: sara is running 0 secs || 2877 markings, 9720 edges, 575 markings/sec, 0 secs
lola: sara is running 5 secs || 5803 markings, 19604 edges, 585 markings/sec, 5 secs
lola: sara is running 10 secs || 8722 markings, 29488 edges, 584 markings/sec, 10 secs
lola: sara is running 15 secs || 11622 markings, 40566 edges, 580 markings/sec, 15 secs
lola: sara is running 20 secs || 14551 markings, 50418 edges, 586 markings/sec, 20 secs
lola: sara is running 25 secs || 17490 markings, 60474 edges, 588 markings/sec, 25 secs
lola: sara is running 30 secs || 20381 markings, 70534 edges, 578 markings/sec, 30 secs
lola: sara is running 35 secs || 23264 markings, 81063 edges, 577 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 26199 markings, 90189 edges, 587 markings/sec, 40 secs
lola: sara is running 45 secs || 29148 markings, 98700 edges, 590 markings/sec, 45 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__41_30_) AND (((1 <= cAMP__26_16_) AND (2 <= cAMP__27_48_)) OR (2 <= cAMP__30_42_)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= cAMP__41_30_) AND (((1 <= cAMP__26_16_) AND (2 <= cAMP__27_48_)) OR (2 <= cAMP__30_42_)))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= cAMP__41_30_) AND (((1 <= cAMP__26_16_) AND (2 <= cAMP__27_48_)) OR (2 <= cAMP__30_42_)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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.
lola: sara is running 0 secs || 2881 markings, 10142 edges, 576 markings/sec, 0 secs
lola: sara is running 5 secs || 5772 markings, 20323 edges, 578 markings/sec, 5 secs
lola: sara is running 10 secs || 8655 markings, 30377 edges, 577 markings/sec, 10 secs
lola: sara is running 15 secs || 11526 markings, 40361 edges, 574 markings/sec, 15 secs
lola: sara is running 20 secs || 14367 markings, 50043 edges, 568 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16111 markings, 55984 edges
lola: ========================================
lola: subprocess 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__43_47_ + 1 <= cAMP__22_27_) OR (cAMP__36_8_ <= 0) OR (cAMP__46_47_ <= 0) OR (cAMP__27_11_ <= 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 (((cAMP__43_47_ + 1 <= cAMP__22_27_) OR (cAMP__36_8_ <= 0) OR (cAMP__46_47_ <= 0) OR (cAMP__27_11_ <= 1))))
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: ((cAMP__22_27_ <= cAMP__43_47_) AND (1 <= cAMP__36_8_) AND (1 <= cAMP__46_47_) AND (2 <= cAMP__27_11_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 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.
lola: sara is running 0 secs || 2941 markings, 10194 edges, 588 markings/sec, 0 secs
lola: sara is running 5 secs || 5501 markings, 18949 edges, 512 markings/sec, 5 secs
lola: sara is running 10 secs || 8449 markings, 28896 edges, 590 markings/sec, 10 secs
lola: sara is running 15 secs || 11404 markings, 38980 edges, 591 markings/sec, 15 secs
lola: sara is running 20 secs || 14364 markings, 49256 edges, 592 markings/sec, 20 secs
lola: sara is running 25 secs || 17328 markings, 59225 edges, 593 markings/sec, 25 secs
lola: sara is running 30 secs || 20234 markings, 69210 edges, 581 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21367 markings, 73213 edges
lola: ========================================
lola: subprocess 7 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__14_36_) OR (1 <= cAMP__38_31_) OR (3 <= cAMP__27_11_) OR ((cAMP__38_23_ + 1 <= cAMP__28_38_) AND (cAMP__42_45_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((2 <= cAMP__14_36_) OR (1 <= cAMP__38_31_) OR (3 <= cAMP__27_11_) OR ((cAMP__38_23_ + 1 <= cAMP__28_38_) AND (cAMP__42_45_ <= 1)))))
lola: processed formula length: 142
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 <= cAMP__14_36_) OR (1 <= cAMP__38_31_) OR (3 <= cAMP__27_11_) OR ((cAMP__38_23_ + 1 <= cAMP__28_38_) AND (cAMP__42_45_ <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 4 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.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 297 markings, 1093 edges
lola: ========================================
lola: subprocess 8 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__20_7_) AND (2 <= cAMP__26_26_) AND (1 <= cAMP__41_37_) AND (1 <= cAMP__40_24_) AND (cAMP__48_36_ <= cAMP__1_29_))))
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 <= cAMP__20_7_) AND (2 <= cAMP__26_26_) AND (1 <= cAMP__41_37_) AND (1 <= cAMP__40_24_) AND (cAMP__48_36_ <= cAMP__1_29_))))
lola: processed formula length: 134
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 <= cAMP__20_7_) AND (2 <= cAMP__26_26_) AND (1 <= cAMP__41_37_) AND (1 <= cAMP__40_24_) AND (cAMP__48_36_ <= cAMP__1_29_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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.
lola: sara is running 0 secs || 1847 markings, 6649 edges, 369 markings/sec, 0 secs
lola: sara is running 5 secs || 3322 markings, 11766 edges, 295 markings/sec, 5 secs
lola: sara is running 10 secs || 4794 markings, 17049 edges, 294 markings/sec, 10 secs
lola: sara is running 15 secs || 6575 markings, 24097 edges, 356 markings/sec, 15 secs
lola: sara is running 20 secs || 8171 markings, 29820 edges, 319 markings/sec, 20 secs
lola: sara is running 25 secs || 9647 markings, 35465 edges, 295 markings/sec, 25 secs
lola: sara is running 30 secs || 11111 markings, 40642 edges, 293 markings/sec, 30 secs
lola: sara is running 35 secs || 12820 markings, 46886 edges, 342 markings/sec, 35 secs
lola: sara is running 40 secs || 15791 markings, 57417 edges, 594 markings/sec, 40 secs
lola: sara is running 45 secs || 18763 markings, 67960 edges, 594 markings/sec, 45 secs
lola: sara is running 50 secs || 21742 markings, 78675 edges, 596 markings/sec, 50 secs
lola: sara is running 55 secs || 24258 markings, 87572 edges, 503 markings/sec, 55 secs
lola: sara is running 60 secs || 25729 markings, 92606 edges, 294 markings/sec, 60 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25935 markings, 93190 edges
lola: ========================================
lola: subprocess 9 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__40_44_) AND (cAMP__37_4_ <= cAMP__21_18_) AND (cAMP__26_31_ <= cAMP__6_48_) AND (1 <= cAMP__13_6_))))
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 <= cAMP__40_44_) AND (cAMP__37_4_ <= cAMP__21_18_) AND (cAMP__26_31_ <= cAMP__6_48_) AND (1 <= cAMP__13_6_))))
lola: processed formula length: 120
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 <= cAMP__40_44_) AND (cAMP__37_4_ <= cAMP__21_18_) AND (cAMP__26_31_ <= cAMP__6_48_) AND (1 <= cAMP__13_6_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 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.
lola: sara is running 0 secs || 2732 markings, 9683 edges, 546 markings/sec, 0 secs
lola: sara is running 5 secs || 5532 markings, 19307 edges, 560 markings/sec, 5 secs
lola: sara is running 10 secs || 8305 markings, 29148 edges, 555 markings/sec, 10 secs
lola: sara is running 15 secs || 11062 markings, 38912 edges, 551 markings/sec, 15 secs
lola: sara is running 20 secs || 13810 markings, 48772 edges, 550 markings/sec, 20 secs
lola: sara is running 25 secs || 16571 markings, 58383 edges, 552 markings/sec, 25 secs
lola: sara is running 30 secs || 19344 markings, 68053 edges, 555 markings/sec, 30 secs
lola: sara is running 35 secs || 22072 markings, 77805 edges, 546 markings/sec, 35 secs
lola: sara is running 40 secs || 24060 markings, 85016 edges, 398 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 26794 markings, 94802 edges, 547 markings/sec, 45 secs
lola: sara is running 50 secs || 29580 markings, 104321 edges, 557 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__23_48_ + 1 <= cAMP__2_50_) AND (cAMP__35_15_ + 1 <= cAMP__6_40_) AND ((cAMP__4_39_ + 1 <= cAMP__19_23_) OR (cAMP__15_50_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((cAMP__23_48_ + 1 <= cAMP__2_50_) AND (cAMP__35_15_ + 1 <= cAMP__6_40_) AND ((cAMP__4_39_ + 1 <= cAMP__19_23_) OR (cAMP__15_50_ <= 1)))))
lola: processed formula length: 145
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: ((cAMP__23_48_ + 1 <= cAMP__2_50_) AND (cAMP__35_15_ + 1 <= cAMP__6_40_) AND ((cAMP__4_39_ + 1 <= cAMP__19_23_) OR (cAMP__15_50_ <= 1)))
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-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 2883 markings, 10210 edges, 577 markings/sec, 0 secs
lola: sara is running 5 secs || 5784 markings, 20926 edges, 580 markings/sec, 5 secs
lola: sara is running 10 secs || 8717 markings, 31639 edges, 587 markings/sec, 10 secs
lola: sara is running 15 secs || 11649 markings, 42384 edges, 586 markings/sec, 15 secs
lola: sara is running 20 secs || 14557 markings, 53828 edges, 582 markings/sec, 20 secs
lola: sara is running 25 secs || 17485 markings, 63983 edges, 586 markings/sec, 25 secs
lola: sara is running 30 secs || 20432 markings, 73434 edges, 589 markings/sec, 30 secs
lola: sara is running 35 secs || 23351 markings, 82965 edges, 584 markings/sec, 35 secs
lola: sara is running 40 secs || 26279 markings, 93112 edges, 586 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 29213 markings, 103190 edges, 587 markings/sec, 45 secs
lola: sara is running 50 secs || 32147 markings, 113584 edges, 587 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__6_1_ <= cAMP__42_1_) OR (3 <= cAMP__20_33_) OR (cAMP__13_4_ + 1 <= cAMP__25_46_) OR (cAMP__49_38_ <= cAMP__16_45_))))
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 (((cAMP__6_1_ <= cAMP__42_1_) OR (3 <= cAMP__20_33_) OR (cAMP__13_4_ + 1 <= cAMP__25_46_) OR (cAMP__49_38_ <= cAMP__16_45_))))
lola: processed formula length: 134
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: ((cAMP__42_1_ + 1 <= cAMP__6_1_) AND (cAMP__20_33_ <= 2) AND (cAMP__25_46_ <= cAMP__13_4_) AND (cAMP__16_45_ + 1 <= cAMP__49_38_))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 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.
lola: sara is running 0 secs || 2806 markings, 10123 edges, 561 markings/sec, 0 secs
lola: sara is running 5 secs || 5524 markings, 19686 edges, 544 markings/sec, 5 secs
lola: sara is running 10 secs || 8322 markings, 30195 edges, 560 markings/sec, 10 secs
lola: sara is running 15 secs || 11154 markings, 40662 edges, 566 markings/sec, 15 secs
lola: sara is running 20 secs || 14001 markings, 51103 edges, 569 markings/sec, 20 secs
lola: sara is running 25 secs || 16836 markings, 61532 edges, 567 markings/sec, 25 secs
lola: sara is running 30 secs || 19677 markings, 71891 edges, 568 markings/sec, 30 secs
lola: sara is running 35 secs || 22514 markings, 82356 edges, 567 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 25351 markings, 92776 edges, 567 markings/sec, 40 secs
lola: sara is running 45 secs || 28182 markings, 103164 edges, 566 markings/sec, 45 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((cAMP__48_49_ <= cAMP__33_5_) OR ((cAMP__18_3_ <= cAMP__21_28_) AND ((3 <= cAMP__49_14_) OR (cAMP__5_22_ <= cAMP__14_46_))))))
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 (((cAMP__48_49_ <= cAMP__33_5_) OR ((cAMP__18_3_ <= cAMP__21_28_) AND ((3 <= cAMP__49_14_) OR (cAMP__5_22_ <= cAMP__14_46_))))))
lola: processed formula length: 135
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: ((cAMP__33_5_ + 1 <= cAMP__48_49_) AND ((cAMP__21_28_ + 1 <= cAMP__18_3_) OR ((cAMP__49_14_ <= 2) AND (cAMP__14_46_ + 1 <= cAMP__5_22_))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 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.
lola: sara is running 0 secs || 2938 markings, 10194 edges, 588 markings/sec, 0 secs
lola: sara is running 5 secs || 5875 markings, 20062 edges, 587 markings/sec, 5 secs
lola: sara is running 10 secs || 8799 markings, 30126 edges, 585 markings/sec, 10 secs
lola: sara is running 15 secs || 11733 markings, 40037 edges, 587 markings/sec, 15 secs
lola: sara is running 20 secs || 14655 markings, 50072 edges, 584 markings/sec, 20 secs
lola: sara is running 25 secs || 17592 markings, 59503 edges, 587 markings/sec, 25 secs
lola: sara is running 30 secs || 20481 markings, 67815 edges, 578 markings/sec, 30 secs
lola: sara is running 35 secs || 23390 markings, 76817 edges, 582 markings/sec, 35 secs
lola: sara is running 40 secs || 26322 markings, 86822 edges, 586 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 29166 markings, 96756 edges, 569 markings/sec, 45 secs
lola: sara is running 50 secs || 32066 markings, 106960 edges, 580 markings/sec, 50 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 833 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cAMP__15_21_) OR (3 <= cAMP__45_29_) OR ((cAMP__15_30_ <= cAMP__41_31_) AND (cAMP__4_41_ <= cAMP__3_49_)) OR (cAMP__10_41_ <= cAMP__5_6_))))
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 <= cAMP__15_21_) OR (3 <= cAMP__45_29_) OR ((cAMP__15_30_ <= cAMP__41_31_) AND (cAMP__4_41_ <= cAMP__3_49_)) OR (cAMP__10_41_ <= cAMP__5_6_))))
lola: processed formula length: 156
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: ((cAMP__15_21_ <= 1) AND (cAMP__45_29_ <= 2) AND ((cAMP__41_31_ + 1 <= cAMP__15_30_) OR (cAMP__3_49_ + 1 <= cAMP__4_41_)) AND (cAMP__5_6_ + 1 <= cAMP__10_41_))
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-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1052 markings, 3589 edges
lola: ========================================
lola: subprocess 14 will run for 1248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__2_48_) AND (2 <= cAMP__26_18_) AND (cAMP__45_12_ + 1 <= cAMP__39_38_) AND (((cAMP__35_29_ <= cAMP__31_8_) AND (cAMP__16_25_ <= cAMP__18_20_)) OR (cAMP__7_32_ <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((3 <= cAMP__2_48_) AND (2 <= cAMP__26_18_) AND (cAMP__45_12_ + 1 <= cAMP__39_38_) AND (((cAMP__35_29_ <= cAMP__31_8_) AND (cAMP__16_25_ <= cAMP__18_20_)) OR (cAMP__7_32_ <= 1)))))
lola: processed formula length: 187
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 <= cAMP__2_48_) AND (2 <= cAMP__26_18_) AND (cAMP__45_12_ + 1 <= cAMP__39_38_) AND (((cAMP__35_29_ <= cAMP__31_8_) AND (cAMP__16_25_ <= cAMP__18_20_)) OR (cAMP__7_32_ <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 9 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.
lola: sara is running 0 secs || 2061 markings, 7084 edges, 412 markings/sec, 0 secs
lola: sara is running 5 secs || 4890 markings, 16816 edges, 566 markings/sec, 5 secs
lola: sara is running 10 secs || 7692 markings, 26471 edges, 560 markings/sec, 10 secs
lola: sara is running 15 secs || 10486 markings, 36011 edges, 559 markings/sec, 15 secs
lola: sara is running 20 secs || 13386 markings, 46017 edges, 580 markings/sec, 20 secs
lola: sara is running 25 secs || 16269 markings, 56386 edges, 577 markings/sec, 25 secs
lola: sara is running 30 secs || 19119 markings, 66530 edges, 570 markings/sec, 30 secs
lola: sara is running 35 secs || 22010 markings, 76796 edges, 578 markings/sec, 35 secs
lola: sara is running 40 secs || 24888 markings, 87500 edges, 576 markings/sec, 40 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 45 secs || 27795 markings, 97366 edges, 581 markings/sec, 45 secs
lola: sara is running 50 secs || 30717 markings, 105979 edges, 584 markings/sec, 50 secs
lola: sara is running 55 secs || 33637 markings, 115106 edges, 584 markings/sec, 55 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__36_47_) AND (cAMP__37_44_ <= cAMP__5_29_) AND (1 <= cAMP__13_19_) AND ((2 <= cAMP__29_20_) OR (cAMP__26_2_ <= cAMP__50_35_) OR (3 <= cAMP__13_31_) OR (cAMP__5_40_ <= cAMP__39_13_)))))
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 <= cAMP__36_47_) AND (cAMP__37_44_ <= cAMP__5_29_) AND (1 <= cAMP__13_19_) AND ((2 <= cAMP__29_20_) OR (cAMP__26_2_ <= cAMP__50_35_) OR (3 <= cAMP__13_31_) OR (cAMP__5_40_ <= cAMP__39_13_)))))
lola: processed formula length: 205
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 <= cAMP__36_47_) AND (cAMP__37_44_ <= cAMP__5_29_) AND (1 <= cAMP__13_19_) AND ((2 <= cAMP__29_20_) OR (cAMP__26_2_ <= cAMP__50_35_) OR (3 <= cAMP__13_31_) OR (cAMP__5_40_ <= cAMP__39_13_)))
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-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-15-0.sara.
lola: sara is running 0 secs || 2721 markings, 10049 edges, 544 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4712 markings, 17064 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no yes yes no yes no yes yes yes no
lola:
preliminary result: yes yes no no yes yes no yes yes no yes no yes yes yes no
lola: memory consumption: 786220 KB
lola: time consumption: 1144 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552600988993
--------------------
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="Diffusion2D-PT-D50N100"
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 Diffusion2D-PT-D50N100, 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 r060-ebro-155234654900251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D50N100.tgz
mv Diffusion2D-PT-D50N100 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 ;