About the Execution of LoLA for LamportFastMutEx-COL-5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4324.770 | 5133.00 | 5240.00 | 32.50 | FTFFTTTTTTTTFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r093-smll-155246584100152.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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-3957
Executing tool lola
Input is LamportFastMutEx-COL-5, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r093-smll-155246584100152
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.0K Feb 11 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K 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.6K Feb 5 00:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 06:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 06:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jan 31 23:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 31 23:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 41K 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 LamportFastMutEx-COL-5-ReachabilityCardinality-00
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-01
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-02
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-03
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-04
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-05
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-06
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-07
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-08
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-09
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-5-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1552768877757
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-COL-5 @ 3570 seconds
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-COL-5-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityCardinality @ LamportFastMutEx-COL-5
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Mar 16 20:41:17 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 12
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p168 + p169 + p170 + p171 + p172 + p173))))",
"processed_size": 56,
"rewrites": 13
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": true
},
"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": 324
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((2 <= p168 + p169 + p170 + p171 + p172 + p173)))",
"processed_size": 54,
"rewrites": 13
},
"result":
{
"edges": 10,
"markings": 11,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((p0 + p1 + p2 + p3 + p4 + p5 <= 1)))",
"processed_size": 42,
"rewrites": 14
},
"result":
{
"edges": 2294,
"markings": 1400,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((3 <= p0 + p1 + p2 + p3 + p4 + p5) OR (2 <= p53 + p52 + p51 + p50 + p48 + p49))))",
"processed_size": 89,
"rewrites": 13
},
"result":
{
"edges": 6433,
"markings": 3507,
"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": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))",
"processed_size": 92,
"rewrites": 14
},
"result":
{
"edges": 29,
"markings": 30,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "A (G ((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 0)))",
"processed_size": 224,
"rewrites": 14
},
"result":
{
"edges": 10,
"markings": 11,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (F ((5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)))",
"processed_size": 264,
"rewrites": 13
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 10,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "E (F ((((p114 + p115 + p116 + p117 + p118 + p119 <= p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71)) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p100 + p101 + p96 + p97 + p98 + p99) OR ((p65 + p64 + p63 + p62 + p61 + p60 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (2 <= p42 + p43 + p44 + p45 + p46 + p47)))))",
"processed_size": 346,
"rewrites": 13
},
"result":
{
"edges": 14,
"markings": 15,
"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": 5,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 48,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 48,
"visible_transitions": 0
},
"processed": "A (G (((p65 + p64 + p63 + p62 + p61 + p60 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (2 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126))))",
"processed_size": 362,
"rewrites": 14
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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": 54,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 54,
"visible_transitions": 0
},
"processed": "E (F ((((2 <= p42 + p43 + p44 + p45 + p46 + p47) OR (2 <= p114 + p115 + p116 + p117 + p118 + p119)) AND (1 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 2))))",
"processed_size": 375,
"rewrites": 13
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 66,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 60,
"visible_transitions": 0
},
"processed": "A (G (((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= p93 + p92 + p91 + p90 + p94 + p95) OR (2 <= p168 + p169 + p170 + p171 + p172 + p173) OR ((2 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p42 + p43 + p44 + p45 + p46 + p47 <= p77 + p76 + p75 + p74 + p73 + p72)))))",
"processed_size": 439,
"rewrites": 14
},
"result":
{
"edges": 49,
"markings": 50,
"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": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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": 132,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 90,
"visible_transitions": 0
},
"processed": "E (F (((p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) AND ((p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) OR (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 1)))))",
"processed_size": 875,
"rewrites": 13
},
"result":
{
"edges": 15,
"markings": 16,
"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": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 79212,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : TRUE : FALSE : A(G(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : E(F(**)) : TRUE : TRUE : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1380,
"conflict_clusters": 15,
"places": 174,
"places_significant": 124,
"singleton_clusters": 0,
"transitions": 318
},
"result":
{
"preliminary_value": "no yes no no yes yes yes yes yes yes yes yes no no yes no ",
"value": "no yes no no yes yes yes yes yes yes yes yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains High-Level net
lola: Places: 174, Transitions: 318
lola: @ trans T-setbi_24
lola: @ trans T-fordo_12
lola: @ trans T-awaity
lola: @ trans T-yeqi_15
lola: @ trans T-setbi_11
lola: @ trans T-await_13
lola: @ trans T-ynei_15
lola: @ trans T-yne0_4
lola: @ trans T-setbi_5
lola: @ trans T-sety0_23
lola: @ trans T-xeqi_10
lola: @ trans T-sety_9
lola: @ trans T-xnei_10
lola: @ trans T-yeq0_4
lola: @ trans T-setbi_2
lola: @ trans T-forod_13
lola: @ trans T-setx_3
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 492/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 174
lola: finding significant places
lola: 174 places, 318 transitions, 124 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: place invariant simplifies atomic proposition
lola: before: (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 <= p108 + p109 + p110 + p111 + p112 + p113)
lola: after: (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p108 + p109 + p110 + p111 + p112 + p113)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p108 + p109 + p110 + p111 + p112 + p113)
lola: after: (0 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (p108 + p109 + p110 + p111 + p112 + p113 <= p168 + p169 + p170 + p171 + p172 + p173)
lola: after: (1 <= p168 + p169 + p170 + p171 + p172 + p173)
lola: place invariant simplifies atomic proposition
lola: before: (p88 + p86 + p84 + p82 + p80 + p78 + p79 + p81 + p83 + p85 + p87 + p89 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)
lola: after: (5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p58 + p57 + p56 + p55 + p54 + p59)
lola: after: (2 <= 0)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p88 + p86 + p84 + p82 + p80 + p78 + p79 + p81 + p83 + p85 + p87 + p89)
lola: after: (0 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (p42 + p43 + p44 + p45 + p46 + p47 <= p108 + p109 + p110 + p111 + p112 + p113)
lola: after: (p42 + p43 + p44 + p45 + p46 + p47 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 + p3 + p4 + p5 <= p58 + p57 + p56 + p55 + p54 + p59)
lola: after: (p0 + p1 + p2 + p3 + p4 + p5 <= 1)
lola: A (G (((p65 + p64 + p63 + p62 + p61 + p60 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (2 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)))) : A (G ((0 <= 0))) : E (F (())) : A (G ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107))) : E (F ((((2 <= p42 + p43 + p44 + p45 + p46 + p47) OR (2 <= p114 + p115 + p116 + p117 + p118 + p119)) AND (1 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 2)))) : E (F ((5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126))) : E (F (((3 <= p168 + p169 + p170 + p171 + p172 + p173)))) : E (F ((2 <= p168 + p169 + p170 + p171 + p172 + p173))) : E (F (((p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) AND ((p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) OR (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 1))))) : E (F (((3 <= p0 + p1 + p2 + p3 + p4 + p5) OR (2 <= p53 + p52 + p51 + p50 + p48 + p49)))) : A (G (())) : A (G (())) : A (G ((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 0))) : A (G (((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= p93 + p92 + p91 + p90 + p94 + p95) OR (2 <= p168 + p169 + p170 + p171 + p172 + p173) OR ((2 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p42 + p43 + p44 + p45 + p46 + p47 <= p77 + p76 + p75 + p74 + p73 + p72))))) : E (F ((((p114 + p115 + p116 + p117 + p118 + p119 <= p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71)) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p100 + p101 + p96 + p97 + p98 + p99) OR ((p65 + p64 + p63 + p62 + p61 + p60 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (2 <= p42 + p43 + p44 + p45 + p46 + p47))))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 <= 1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 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: 12 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 12 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p168 + p169 + p170 + p171 + p172 + p173))))
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 <= p168 + p169 + p170 + p171 + p172 + p173))))
lola: processed formula length: 56
lola: 13 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 <= p168 + p169 + p170 + p171 + p172 + p173))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p168 + p169 + p170 + p171 + p172 + p173)))
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 <= p168 + p169 + p170 + p171 + p172 + p173)))
lola: processed formula length: 54
lola: 13 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 <= p168 + p169 + p170 + p171 + p172 + p173)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 <= 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 ((p0 + p1 + p2 + p3 + p4 + p5 <= 1)))
lola: processed formula length: 42
lola: 14 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 <= p0 + p1 + p2 + p3 + p4 + p5)
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-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1400 markings, 2294 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p0 + p1 + p2 + p3 + p4 + p5) OR (2 <= p53 + p52 + p51 + p50 + p48 + p49))))
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 <= p0 + p1 + p2 + p3 + p4 + p5) OR (2 <= p53 + p52 + p51 + p50 + p48 + p49))))
lola: processed formula length: 89
lola: 13 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 <= p0 + p1 + p2 + p3 + p4 + p5) OR (2 <= p53 + p52 + p51 + p50 + p48 + p49))
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-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: 3507 markings, 6433 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))
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 ((p120 + p121 + p122 + p123 + p124 + p125 <= p102 + p103 + p104 + p105 + p106 + p107)))
lola: processed formula length: 92
lola: 14 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: (p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p120 + p121 + p122 + p123 + p124 + p125)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 0)))
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 ((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 0)))
lola: processed formula length: 224
lola: 14 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: (1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)))
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 ((5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)))
lola: processed formula length: 264
lola: 13 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: (5 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p114 + p115 + p116 + p117 + p118 + p119 <= p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71)) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p100 + p101 + p96 + p97 + p98 + p99) OR ((p65 + p64 + p63 + p62 + p61 + p60 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (2 <= p42 + p43 + p44 + p45 + p46 + p47)))))
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 ((((p114 + p115 + p116 + p117 + p118 + p119 <= p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71)) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p100 + p101 + p96 + p97 + p98 + p99) OR ((p65 + p64 + p63 + p62 + p61 + p60 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (2 <= p42 + p43 + p44 + p45 + p46 + p47)))))
lola: processed formula length: 346
lola: 13 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: (((p114 + p115 + p116 + p117 + p118 + p119 <= p162 + p163 + p164 + p165 + p166 + p167) AND (1 <= p66 + p67 + p68 + p69 + p70 + p71)) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p100 + p101 + p96 + p97 + p98 + p99) OR ((p65 + p64 + p63 + p62 + p61 + p60 + 1 <= p0 + p1 + p2 + p3 + p4 + p5) AND (2 <= p42 + p43 + p44 + p45 + p46 + p47)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p65 + p64 + p63 + p62 + p61 + p60 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (2 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126))))
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 (((p65 + p64 + p63 + p62 + p61 + p60 <= 2) OR (p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (2 <= p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126))))
lola: processed formula length: 362
lola: 14 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 <= p65 + p64 + p63 + p62 + p61 + p60) AND (2 <= p102 + p103 + p104 + p105 + p106 + p107) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p42 + p43 + p44 + p45 + p46 + p47) OR (2 <= p114 + p115 + p116 + p117 + p118 + p119)) AND (1 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((2 <= p42 + p43 + p44 + p45 + p46 + p47) OR (2 <= p114 + p115 + p116 + p117 + p118 + p119)) AND (1 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 2))))
lola: processed formula length: 375
lola: 13 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 <= p42 + p43 + p44 + p45 + p46 + p47) OR (2 <= p114 + p115 + p116 + p117 + p118 + p119)) AND (1 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 2))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= p93 + p92 + p91 + p90 + p94 + p95) OR (2 <= p168 + p169 + p170 + p171 + p172 + p173) OR ((2 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p42 + p43 + p44 + p45 + p46 + p47 <=... (shortened)
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 (((p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= p93 + p92 + p91 + p90 + p94 + p95) OR (2 <= p168 + p169 + p170 + p171 + p172 + p173) OR ((2 <= p168 + p169 + p170 + p171 + p172 + p173) AND (p42 + p43 + p44 + p45 + p46 + p47 <=... (shortened)
lola: processed formula length: 439
lola: 14 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: ((p93 + p92 + p91 + p90 + p94 + p95 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p168 + p169 + p170 + p171 + p172 + p173 <= 1) AND ((p168 + p169 + p170 + p171 + p172 + p173 <= 1) OR (p77 + p76 + p75 + p74 + p73 + p72 + 1 <= p42 + p43 + p44 + p45 + p46 + p47)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p14... (shortened)
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 (((p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p14... (shortened)
lola: processed formula length: 875
lola: 13 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: ((p120 + p121 + p122 + p123 + p124 + p125 + 1 <= p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10) AND (p127 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p129 + p128 + p126 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) AND ((p102 + p103 + p104 + p105 + p106 + p107 + 1 <= p42 + p43 + p44 + p45 + p46 + p47) OR (p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p37 + p41 + p40 + p39 + p38 + p36 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10 <= 1)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes yes yes yes yes yes no no yes no
lola:
preliminary result: no yes no no yes yes yes yes yes yes yes yes no no yes no
lola: memory consumption: 79212 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
BK_STOP 1552768882890
--------------------
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="LamportFastMutEx-COL-5"
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-3957"
echo " Executing tool lola"
echo " Input is LamportFastMutEx-COL-5, 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 r093-smll-155246584100152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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 ;